On the impact of combinatorial structure on congestion games

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 613-622

  Ackermann, Heiner ^a   Röglin, Heiko ^a   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; GAME THEORY; POLYNOMIALS;

COMBINATORIAL STRUCTURE; CONGESTION GAMES; NASH EQUILIBRIUM;

DATA STRUCTURES;

EID: 38049022208     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.55     Document Type: Conference Paper

References (15)

1. H. Ackermann, H. Röglin, and B. Vöcking. On the impact of combinatorial structure on congestion games. Technical Report TR06-067, ECCC, 2006.
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. In Proc 45th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pages 295-304, 2004.
3. A. Fabrikant, C. Papadimitriou, and K. Talwar. The complexity of pure Nash equilibria. In Proc 36th Ann. ACM. Symp. on Theory of Comput. (STOC), pages 604-612, 2004.
4. M. X. Goemans, E. L. Li, V. S. Mirrokni, and M. Thottan. Market sharing games applied to content distribution in ad-hoc networks. In MobiHoc, pages 55-66, 2004.
5. A. Haken. Connectionist networks that need exponential time to stabilize. Unpublished manuscript. Department of Computer Science, University of Toronto, 1989.
6. S. Ieong, R. McGrew, E. Nudelman, Y. Shoham, and Q. Sun. Fast and compact: A simple class of congestion games. In 20th National Conference on Artificial Intelligence (AAAI), 2005.
7. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis. How easy is local search? J. Comput. Syst. Sci., 37(1):79-100, 1988.
8. V. S. Mirrokni. Approximation Algorithms for Distributed and Selfish Agents. PhD thesis, Massachusetts Institute of Technology, 2005.
9. P. Orponen. Computing with truly asynchronous threshold logic networks. Theor. Comput. Sci., 174(1-2): 123-136, 1997.
10. S. Poljak. Integer linear programs and local search for max-cut. SIAM J. Comput., 24(4):822-839, 1995.
11. R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. Intern. J. of Game Theory, 2:65-67, 1973.
12. A. A. Schärfer and M. Yannakakis. Simple local search problems that are hard to solve. SIAM J. Comput., 20(1):56-87, 1991.
13. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Volume B, Matroids, Trees, Stable Sets, Chapters 39-69. Springer, 2003.
14. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana. Internet indirection infrastructure. IEEE/ACM Trans. Netw., 12(2):205-218, 2004.
15. R. Werneck, J. Setubal, and A. da Conceicão. Finding minimum congestion spanning trees. J. Exp. Algorithmics, 5:11, 2000.