SAGT B

29 papers

YearTitle / Authors
2011A Clustering Coefficient Network Formation Game.
Michael Brautbar, Michael J. Kearns
2011A Truthful Mechanism for Value-Based Scheduling in Cloud Computing.
Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
2011Algorithmic Game Theory, 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings
Giuseppe Persiano
2011Combinatorial Agency of Threshold Functions.
Shaili Jain, David C. Parkes
2011Complexity of Rational and Irrational Nash Equilibria.
Vittorio Bilò, Marios Mavronicolas
2011Computation and Incentives of Competitive Equilibria in a Matching Market.
Ning Chen, Xiaotie Deng
2011Computational Game Theory.
Bruno Codenotti
2011Diffusion in Social Networks with Competing Products.
Krzysztof R. Apt, Evangelos Markakis
2011Dynamic Inefficiency: Anarchy without Stability.
Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal
2011Efficiency of Restricted Tolls in Non-atomic Network Routing Games.
Vincenzo Bonifaci, Mahyar Salek, Guido Schäfer
2011Externalities among Advertisers in Sponsored Search.
Dimitris Fotakis, Piotr Krysta, Orestis Telelis
2011Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines.
Lisa Fleischer, Zhenghui Wang
2011On Communication Protocols That Compute Almost Privately.
Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan
2011On Dynamics in Basic Network Creation Games.
Pascal Lenzner
2011On the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion Games.
Long Tran-Thanh, Maria Polukarov, Archie C. Chapman, Alex Rogers, Nicholas R. Jennings
2011Pareto Optimality in Coalition Formation.
Haris Aziz, Felix Brandt, Paul Harrenstein
2011Peer Effects and Stability in Matching Markets.
Elizabeth Bodine-Baron, Christina Lee, Anthony Chong, Babak Hassibi, Adam Wierman
2011Pricing Exotic Derivatives Using Regret Minimization.
Eyal Gofer, Yishay Mansour
2011Prompt Mechanism for Ad Placement over Time.
Yossi Azar, Ety Khaitzin
2011Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof).
Panagiota N. Panagopoulou, Paul G. Spirakis
2011Repeated Budgeted Second Price Ad Auction.
Asaph Arnon, Yishay Mansour
2011Scheduling without Payments.
Elias Koutsoupias
2011Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities.
Oskar Skibski
2011Stochastic Selfish Routing.
Evdokia Nikolova, Nicolás E. Stier Moses
2011Strategic Pricing in Next-Hop Routing with Elastic Demands.
Elliot Anshelevich, Ameya Hate, Koushik Kar
2011The Multiple Attribution Problem in Pay-Per-Conversion Advertising.
Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee
2011The Price of Optimum in a Matching Game.
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2011Throw One's Cake - and Eat It Too.
Orit Arzi, Yonatan Aumann, Yair Dombb
2011Weakly-Acyclic (Internet) Routing Games.
Roee Engelberg, Michael Schapira