Active Bibliography

89 Stackelberg scheduling strategies – Tim Roughgarden - 2001
Cost Sharing and Clustering . . . – Martin Hoefer - 2007
23 Nash Equilibria in Discrete Routing Games with Convex Latency Functions – Martin Gairing, Martin Gairing, Thomas Lücking, Thomas Lücking, Marios Mavronicolas, Marios Mavronicolas, Burkhard Monien, Burkhard Monien, Manuel Rode, Manuel Rode - 2004
4 An algorithmic game theory primer – Tim Roughgarden - 2008
38 A survey on networking games in telecommunications – E. Altman , T. Boulogne , R. El-azouzi, T. Jiménez , L. Wynter - 2004
8 Approximation Algorithms for Distributed and Selfish Agents – Vahab S. Mirrokni - 2005
6 SECURITY AND COOPERATION IN WIRELESS NETWORKS -- Thwarting Malicious and Selfish Behavior in the Age of Ubiquitous Computing – Levente Buttyán, Jean-pierre Hubaux - 2007
53 Designing networks for selfish users is hard – Tim Roughgarden - 2001
Multicommodity Routing Problems -- Selfish . . . – Tobias Harks - 2007
47 Computing Equilibria in Multi-Player Games – Christos H. Papadimitriou, Tim Roughgarden - 2004
46 Pure Nash Equilibria: Hard and Easy Games – Georg Gottlob, Gianluigi Greco, Francesco Scarcello
6 Computing equilibria: A computational complexity perspective – Tim Roughgarden - 2009
35 Coordination mechanisms – George Christodoulou, Elias Koutsoupias, Akash Nanavati - 2004
Network Connection Games -- Near-Optimal Networks designed with Selfish Agents – Martin Hoefer - 2004
14 The price of anarchy for polynomial social cost – Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien - 2004
21 Exact Price of Anarchy for Polynomial Congestion Games – Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann - 2006
A MEAN-RISK MODEL FOR THE STOCHASTIC TRAFFIC ASSIGNMENT PROBLEM – E. Nikolova, N. E. Stier-moses - 2011
46 How Much Can Taxes Help Selfish Routing? – Richard Cole, Yevgeniy Dodis, Tim Roughgarden - 2003
142 The price of anarchy is independent of the network topology – Tim Roughgarden - 2002