Worst-case equilibria

Computer Science Review

Volumn 3, Issue 2, 2009, Pages 65-69

  Koutsoupias, Elias ^a   Papadimitriou, Christos ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON RESOURCES; COORDINATION RATIO; NASH EQUILIBRIA; NON-COOPERATIVE AGENTS; PRICE OF ANARCHY; SIMPLE NETWORKS; SOCIAL OPTIMUMS; UPPER AND LOWER BOUNDS;

TELECOMMUNICATION NETWORKS;

COSTS;

EID: 66049115516     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2009.04.003     Document Type: Article

References (18)

1. B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L. Peterson, K. Ramakrishnan, S. Shenker, J. Wroclawski, L. Zhang, Recommendations on queue management and congestion avoidance in the Internet, April 1998. http://info.internet.isi.edu:80/in-notes/rfc/files/rfc2309.txt
2. Owen G. Game Theory. 3rd ed. (1995), Academic Press
3. C.H. Papadimitriou, M. Yannakakis, On complexity as bounded rationality, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, 23-25 May 1994, pp. 726-733
4. Korilis Y., and Lazar A. On the existence of equilibria in noncooperative optimal flow control. Journal of the ACM 42 3 (1995) 584-613
5. R. La, V. Anantharam, Optimal routing control: Game theoretic approach, in: Proc. 1997 CDC Conf.
6. Shenker S.J. Making greed work in networks: A game-theoretic analysis of switch service disciplines. IEEE/ACM Transactions on Networking 3 6 (1995) 819-831
7. Shenker S., Clark D., Estrin D., and Herzog S. Pricing in computer network: Reshaping the research agenda. Communications Policy 20 1 (1996)
8. Korilis Y., Lazar A., and Orda A. Architecting noncooperative networks. IEEE Journal on Selected Areas of Communications 13 (1995) 7
9. Nisan N., Roughgarden T., Tardos E., and Vazirani V.V. Algorithmic Game Theory (2007), Cambridge University Press
10. A. Czumaj, B. Vöcking, Tight bounds for worst-case equilibria, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2002, pp. 413-420
11. E. Koutsoupias, M. Mavronicolas, P. Spirakis, Approximate equilibria and ball fusion, in: Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, SIROCCO, 2002
12. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
13. T. Roughgarden, E. Tardos, How bad is selfish routing? in: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, November 12-14, 2000, pp. 93-102
14. N. Nisan, A. Ronen, Algorithmic mechanism design, in: Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, May 01-04, 1999, Atlanta, Georgia, United States, pp. 129-140
15. N. Nisan, Algorithms for selfish agents: Mechanism design for distributed computation, in: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 1999, pp. 1-15
16. Cho Y., and Sahni S. Bounds for list schedules on uniform processors. SIAM Journal on Computing 9 1 (1980) 91-103
17. E. Koutsoupias, C.H. Papadimitriou, Worst-case equilibria, in: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 1999, pp. 404-413
18. C.H. Papadimitriou, Algorithms, games, and the Internet, in: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, 2001, pp. 749-753