Abstract is missing.
- A Classification of Weakly Acyclic GamesKrzysztof R. Apt, Sunil Simon. 1-12 [doi]
- Selfishness Level of Strategic GamesKrzysztof R. Apt, Guido Schäfer. 13-24 [doi]
- Mechanisms for Scheduling with Single-Bit Private ValuesVincenzo Auletta, George Christodoulou 0001, Paolo Penna. 25-36 [doi]
- The Complexity of Decision Problems about Nash Equilibria in Win-Lose GamesVittorio Bilò, Marios Mavronicolas. 37-48 [doi]
- An Optimal Bound to Access the Core in TU-GamesSylvain Béal, Eric Rémila, Philippe Solal. 49-60 [doi]
- Convergence of Ordered Improvement Paths in Generalized Congestion GamesK. Ruben Brokkelkamp, Mees J. de Vries. 61-71 [doi]
- Basic Network Creation Games with Communication InterestsAndreas Cord-Landwehr, Martina Hüllmann, Peter Kling, Alexander Setzer. 72-83 [doi]
- Common Knowledge and State-Dependent EquilibriaNuh Aygun Dalkiran, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts, Andrea Vattani. 84-95 [doi]
- Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted CliquesKord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin. 96-107 [doi]
- Approximate Well-Supported Nash Equilibria Below Two-ThirdsJohn Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen. 108-119 [doi]
- Mechanisms and Impossibilities for Truthful, Envy-Free AllocationsMichal Feldman, John K. Lai. 120-131 [doi]
- Capacitated Network Design GamesMichal Feldman, Tom Ron. 132-143 [doi]
- Decentralized Dynamics for Finite Opinion GamesDiodato Ferraioli, Paul W. Goldberg, Carmine Ventre. 144-155 [doi]
- On the Hardness of Network Design for Bottleneck Routing GamesDimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis. 156-167 [doi]
- Ad Auctions with DataHu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii. 168-179 [doi]
- Commodity Auctions and Frugality RatiosPaul W. Goldberg, Antony McCabe. 180-191 [doi]
- On the Communication Complexity of Approximate Nash EquilibriaPaul W. Goldberg, Arnoud Pastink. 192-203 [doi]
- Congestion Games with Capacitated ResourcesLaurent Gourvès, Jérôme Monnot, Stefano Moretti, Nguyen Kim Thang. 204-215 [doi]
- Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable InstancesJochen Könemann, Kate Larson, David Steiner 0002. 216-226 [doi]
- Uniform Price Auctions: Equilibria and EfficiencyEvangelos Markakis, Orestis Telelis. 227-238 [doi]
- Minimizing Expectation Plus VarianceMarios Mavronicolas, Burkhard Monien. 239-250 [doi]
- A Theoretical Examination of Practical Game Playing: Lookahead SearchVahab S. Mirrokni, Nithum Thain, Adrian Vetta. 251-262 [doi]