| 1 | -- | 2 | Marios Mavronicolas. Preface: Algorithmic Game Theory |
| 3 | -- | 23 | Johanne Cohen, Christoph Dürr, Nguyen Kim Thang. Non-clairvoyant Scheduling Games |
| 24 | -- | 45 | Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli. Performance of One-Round Walks in Linear Congestion Games |
| 46 | -- | 70 | Tobias Harks, Max Klimm, Rolf H. Möhring. Characterizing the Existence of Potential Functions in Weighted Congestion Games |
| 71 | -- | 97 | Ronald Koch, Martin Skutella. Nash Equilibria and the Price of Anarchy for Flows over Time |
| 98 | -- | 138 | Elliot Anshelevich, Bugra Caskurlu. Price of Stability in Survivable Network Design |
| 139 | -- | 161 | Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann 0002. The Computational Complexity of Weak Saddles |
| 162 | -- | 181 | Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein. On the Complexity of Iterated Weak Dominance in Constant-Sum Games |
| 182 | -- | 195 | Hyunwoo Jung, Kyung-Yong Chwa. The Balloon Popping Problem Revisited: Lower and Upper Bounds |
| 196 | -- | 223 | Clemens Thielen, Sven Oliver Krumke. Truthful Mechanisms for Selfish Routing and Two-Parameter Agents |