On the structure and complexity of worst-case equilibria

Theoretical Computer Science

Volumn 378, Issue 2, 2007, Pages 165-174

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Balls and bins processes; Fully mixed Nash equilibrium; Job scheduling; Load balancing; Price of Anarchy

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; GAME THEORY; SCHEDULING;

BALLS AND BINS PROCESSES; FULLY MIXED NASH EQUILIBRIUM; JOB SCHEDULING; PRICE OF ANARCHY;

RESOURCE ALLOCATION;

EID: 34248172918     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.019     Document Type: Article

References (11)

1. Koutsoupias E., and Papadimitriou C. Worst-case equilibria. Proc. 16th Int. Symp. on Theoret. Aspects of Comput. Sci. STACS (1999), Springer-Verlag 404-413
2. A. Czumaj, B. Vöcking, Tight bounds for worst-case equilibria, in: Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA, 2002, pp. 413-420
3. Koutsoupias E., Mavronicolas M., and Spirakis P.G. Approximate equilibria and ball fusion. Theory Comput. Syst. 36 6 (2003) 683-693
4. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. 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, Malaga, Spain, 2002, pp. 123-134
5. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, Computing Nash equilibria for scheduling on restricted parallel links, in: Proc. 36th Ann. ACM. Symp. on Theory of Comput., STOC, 2004, pp. 613-622
6. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, P.G. Spirakis, Extreme Nash equilibria, in: Proc. 8th Italian Conference on Theoretical Computer Science, 2003, pp. 1-20
7. Gairing M., Lücking T., Mavronicolas M., Monien B., and Spirakis P.G. Structure and complexity of extreme Nash equilibria. Theoretical Computer Science 343 1-2 (2005) 133-157
8. M. Mavronicolas, P.G. Spirakis, The price of selfish routing, in: Proc. 33rd Ann. ACM. Symp. on Theory of Comput., STOC, 2001, pp. 510-519
9. A. Baltz, A. Srivastav, On the asymptotic inefficiency of the fully mixed Nash equilibrium, Preprint (2005)
10. Gonnet G. Expected length of the longest probe sequence in hash code searching. Journal of the Association for Computing Machinery 28 2 (1981) 289-304
11. Hagerup T., and Rüb C. A guided tour of Chernoff bounds. Information Processing Letters 33 (1990) 305-308