On the structure and complexity of worst-case equilibria

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3828 LNCS, Issue , 2005, Pages 151-160

  Fischer, Simon ^a   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; JOB ANALYSIS; RESOURCE ALLOCATION;

ANARCHY; CONJECTURES; WORST NASH EQUILIBRIA; WORST-CASE EQUILIBRIA;

GAME THEORY;

EID: 33744924201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_16     Document Type: Conference Paper

References (11)

1. Andreas Baltz and Anand Srivastav. On the asymptotic inefficiency of the fully mixed Nash equilibrium. Preprint, 2005.
2. Artur Czumaj and Berthold Vöcking. Tight bounds for worst-case equilibria. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 413-420, 2002.
3. Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, and Paul Spirakis. The structure and complexity of Nash equilibria for a selfish routing game. In Proc. 29th Int. EATCS Coll. on Automata, Languages and Programming (ICALP), pages 123-134, Malaga, Spain, 2002.
4. Martin Gairing, Thomas Lucking, Marios Mavronicolas, and Burkhard Monien. Computing Nash equilibria for scheduling on restricted parallel links. In Proc. 36th Ann. ACM. Symp. on Theory of Comput. (STOC), pages 613-622, 2004.
5. Martin Gairing, Thomas Lucking, Marios Mavronicolas, Burkhard Monien, and Paul G. Spirakis. Extreme Nash equilibria. In Proc. 8th Italian Conference on Theoretical Computer Science, pages 1-20, 2003.
6. Martin Gairing, Thomas Lucking, Marios Mavronicolas, Burkhard Monien, and Paul G. Spirakis. Structure and complexity of extreme Nash equilibria. Theoretical Computer Science, 2005. to appear.
7. G. Gonnet. Expected length of the longest probe sequence in hash code searching. Journal of the Association for Computing Machinery, 28(2):289-304, 1981.
8. Torben Hagerup and Christine Rüb. A guided tour of Chernoff bounds. Information Processing Letters, (33):305-308, 1990.
9. Elias Koutsoupias, Marios Mavronicolas, and Paul G. Spirakis. Approximate equilibria and ball fusion. Theory Comput. Syst., 36(6):683-693, 2003.
10. Elias Koutsoupias and Christos Papadimitriou. Worst-case equilibria. In Proc. 16th Int. Symp. on Theoret. Aspects of Comput. Sci. (STACS), pages 404-413. Springer-Verlag, 1999.
11. Marios Mavronicolas and Paul G. Spirakis. The price of selfish routing. In Proc. 33rd Ann. ACM. Symp. on Theory of Comput. (STOC), pages 510-519, 2001.