| 2011 | Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. | Lisa Fleischer, Zhenghui Wang |
| 2011 | The Price of Optimum in a Matching Game. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2011 | Weakly-Acyclic (Internet) Routing Games. | Roee Engelberg, Michael Schapira |
| 2011 | On Communication Protocols That Compute Almost Privately. | Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan |
| 2011 | Computational Game Theory. | Bruno Codenotti |
| 2011 | Computation and Incentives of Competitive Equilibria in a Matching Market. | Ning Chen, Xiaotie Deng |
| 2011 | A Clustering Coefficient Network Formation Game. | Michael Brautbar, Michael J. Kearns |
| 2011 | Efficiency of Restricted Tolls in Non-atomic Network Routing Games. | Vincenzo Bonifaci, Mahyar Salek, Guido Schfer |
| 2011 | Peer Effects and Stability in Matching Markets. | Elizabeth Bodine-Baron, Christina Lee, Anthony Chong, Babak Hassibi, Adam Wierman |
| 2011 | Complexity of Rational and Irrational Nash Equilibria. | Vittorio Bil, Marios Mavronicolas |
| 2011 | Dynamic Inefficiency: Anarchy without Stability. | Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal |
| 2011 | Pareto Optimality in Coalition Formation. | Haris Aziz, Felix Brandt, Paul Harrenstein |
| 2011 | Prompt Mechanism for Ad Placement over Time. | Yossi Azar, Ety Khaitzin |
| 2011 | Throw One's Cake - and Eat It Too. | Orit Arzi, Yonatan Aumann, Yair Dombb |
| 2011 | Repeated Budgeted Second Price Ad Auction. | Asaph Arnon, Yishay Mansour |
| 2011 | Diffusion in Social Networks with Competing Products. | Krzysztof R. Apt, Evangelos Markakis |
| 2011 | Strategic Pricing in Next-Hop Routing with Elastic Demands. | Elliot Anshelevich, Ameya Hate, Koushik Kar |
| 2010 | 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties. | Vijay V. Vazirani |
| 2010 | No Regret Learning in Oligopolies: Cournot vs. Bertrand. | Uri Nadav, Georgios Piliouras |
| 2010 | Truthful Fair Division. | Elchanan Mossel, Omer Tamuz |
| 2010 | The Price of Anarchy in Network Creation Games Is (Mostly) Constant. | Mats Mihalk, Jan Christoph Schlegel |
| 2010 | Minimal Subsidies in Expense Sharing Games. | Reshef Meir, Yoram Bachrach, Jeffrey S. Rosenschein |
| 2010 | Braess's Paradox for Flows over Time. | Martin Macko, Kate Larson, L'ubos Steskal |
| 2010 | On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms. | Volodymyr Kuleshov, Adrian Vetta |
| 2010 | On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. | Bart de Keijzer, Guido Schfer, Orestis Telelis |