| 2012 | On the Hardness of Network Design for Bottleneck Routing Games. | Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis |
| 2012 | Decentralized Dynamics for Finite Opinion Games. | Diodato Ferraioli, Paul W. Goldberg, Carmine Ventre |
| 2012 | Capacitated Network Design Games. | Michal Feldman, Tom Ron |
| 2012 | Mechanisms and Impossibilities for Truthful, Envy-Free Allocations. | Michal Feldman, John K. Lai |
| 2012 | Approximate Well-Supported Nash Equilibria Below Two-Thirds. | John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Srensen |
| 2012 | Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. | Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin |
| 2012 | Common Knowledge and State-Dependent Equilibria. | Nuh Aygn Dalkiran, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts, Andrea Vattani |
| 2012 | Basic Network Creation Games with Communication Interests. | Andreas Cord-Landwehr, Martina Hllmann, Peter Kling, Alexander Setzer |
| 2012 | Convergence of Ordered Improvement Paths in Generalized Congestion Games. | K. Ruben Brokkelkamp, Mees J. de Vries |
| 2012 | The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games. | Vittorio Bil, Marios Mavronicolas |
| 2012 | An Optimal Bound to Access the Core in TU-Games. | Sylvain Bal, Eric Rmila, Philippe Solal |
| 2012 | Mechanisms for Scheduling with Single-Bit Private Values. | Vincenzo Auletta, George Christodoulou, Paolo Penna |
| 2012 | Selfishness Level of Strategic Games. | Krzysztof R. Apt, Guido Schfer |
| 2012 | A Classification of Weakly Acyclic Games. | Krzysztof R. Apt, Sunil Simon |
| 2011 | On 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 |
| 2011 | Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities. | Oskar Skibski |
| 2011 | Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). | Panagiota N. Panagopoulou, Paul G. Spirakis |
| 2011 | Stochastic Selfish Routing. | Evdokia Nikolova, Nicols E. Stier Moses |
| 2011 | On Dynamics in Basic Network Creation Games. | Pascal Lenzner |
| 2011 | Scheduling without Payments. | Elias Koutsoupias |
| 2011 | The Multiple Attribution Problem in Pay-Per-Conversion Advertising. | Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee |
| 2011 | Combinatorial Agency of Threshold Functions. | Shaili Jain, David C. Parkes |
| 2011 | A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. | Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv |
| 2011 | Pricing Exotic Derivatives Using Regret Minimization. | Eyal Gofer, Yishay Mansour |
| 2011 | Externalities among Advertisers in Sponsored Search. | Dimitris Fotakis, Piotr Krysta, Orestis Telelis |