| 1 | -- | 0 | . A Message from the Springer Editorial Team |
| 2 | -- | 3 | Martin Gairing, Rahul Savani. Preface to the Special Issue on Algorithmic Game Theory |
| 4 | -- | 25 | George Christodoulou 0001, Stefano Leonardi, Alkmini Sgouritsa. Designing Cost-Sharing Methods for Bayesian Games |
| 26 | -- | 53 | Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu. Logarithmic Query Complexity for Approximate Nash Computation in Large Games |
| 54 | -- | 89 | Pieter Kleer, Guido Schäfer. The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games |
| 90 | -- | 113 | Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini. Price of Anarchy for Highly Congested Routing Games in Parallel Networks |
| 114 | -- | 127 | Ioannis Caragiannis, Angelo Fanelli 0001. An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling |
| 128 | -- | 149 | Ágnes Cseh, Robert W. Irving, David F. Manlove. The Stable Roommates Problem with Short Lists |
| 150 | -- | 174 | Yuval Filmus, Joel Oren, Yair Zick, Yoram Bachrach. Analyzing Power in Weighted Voting Games with Super-Increasing Weights |