Volume 49, Issue 1

July 2011

Special Issue: Algorithmic Game Theory

Issue Editor:

10 articles in this issue

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

Search