The effect of collusion in congestion games

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 89-98

  Hayrapetyan, Ara ^a   Tardos, Éva ^a   Wexler, Tom ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Coalitions; Congestion Games; Game Theory; Load Balancing Games; Price of Anarchy; Price of Collusion

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; MARKETING; QUALITY ASSURANCE; SOCIAL ASPECTS;

COALITIONS; CONGESTION GAMES; LOAD-BALANCING GAMES; NASH EQUILIBRIUM; PRICE OF ANARCHY; PRICE OF COLLUSION;

GAME THEORY;

EID: 33748117025     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132529     Document Type: Conference Paper

References (26)

1. E. Altman, T. Başar, T. Jiménez, and N. Shimkin. Competitive Routing in Networks with Polynomial Costs. IEEE Transactions on Automatic Control, 92-96, 2002.
2. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The Price of Stability for Network Design with Fair Cost Allocation. IEEE Symposium on Foundations of Computer Science, 295-304, 2004.
3. R. Aumann. Acceptable Points in General Cooperative n-Person Games. Contributions to the Theory of Games IV Princeton University Press, 1959.
4. B. Awerbuch, Y. Azar, and A. Epstein. The Price of Routing Unsplittable Flow. ACM Symposium on Theory of Computing, 57-66, 2005.
5. M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956.
6. S. Catoni and S. Pallottino. Traffic Equilibrium Paradoxes. Transportation Science, 240-244, 1991.
7. G. Christodoulou and E. Koutsoupias. The Price of Anarchy of Finite Congestion Games. ACM Symposium on Theory of Computing, 67-73, 2005.
8. G. Christodoulou and E. Koutsoupias. On The Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. European Symposium on Algorithms, 59-70, 2005.
9. R. Cominetti, J. R. Correa, and N. E. Stier-Moses. Network Games with Atomic Players. Columbia Working Paper # DRO-2006-03, 2006.
10. J. R. Correa, A. S. Schulz, and N. E. Stier-Moses. On The Inefficiency of Equilibria in Congestion Games. Conference on Integer Programming and Combinatorial Optimization, 167-181, 2005.
11. A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The Complexity of Pure Nash Equilibria. ACM Symposium on Theory of Computing, 604-612, 2004.
12. A. V. Goldberg and J. D. Hartline. Collusion-Resistant Mechanisms for Single-Parameter Agents. ACM-SIAM Symposium on Discrete Algorithms, 620-629, 2005.
13. A. Kothari, S. Suri, C. D. Tóth, and Y. Zhou. Congestion Games, Load Balancing, and Price of Anarchy. Workshop on Combinatorial and Algorithmic Aspects of Networking, 2004.
14. E. Koutsoupias and C. H. Papadimitriou. Worst-Case Equilibria. International Symposium on Theoretical Aspects of Computer Science, 404-413, 1999.
15. I. Milchtaich. Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior, 111-124, 1996.
16. D. Monderer and L. S. Shapley. Potential Games. Games and Economic Behavior, 124-143, 1996.
17. D. Moreno and J. Wooders. Coalition-Proof Equilibrium. Games and Economic Behavior, 80-112, 1996.
18. H. Moulin and S. Shenker. Strategyproof Sharing of Submodular Costs: Budget Balance Versus Efficiency. Economic Theory, 511-533, 2001.
19. A. Orda, R. Rom, and N. Shimkin. Competitive Routing in Multiuser Communication Networks. IEEE/ACM Transactions on Networking, 510-521, 1993.
20. C. H. Papadimitriou. Algorithms, Games and the Internet. ACM Symposium on Theory of Computing, 749-753, 2001.
21. J. B. Rosen. Existence and Uniqueness of Equilibrium Points for Concave N-Person Games. Econometrica, 520-534, 1965.
22. R. W. Rosenthal. A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory, 65-67, 1973.
23. T. Roughgarden. The Price of Anarchy is Independent of the Network Topology. ACM Symposium on Theory of Computing, 428-437, 2002.
24. T. Roughgarden. Selfish Routing with Atomic Players. ACM-SIAM Symposium on Discrete Algorithms, 1184-1185, 2005.
25. T. Roughgarden and É. Tardos. How Bad Is Selfish Routing? Journal of the ACM, 236-259, 2002.
26. S. Suri, C. D. Toth, and Y. Zhou. Selfish Load Balancing and Atomic Congestion Games. ACM Symposium on Parallel Algorithms and Architectures, 188-195, 2004.