Worst-case equilibria

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

Volumn 1563, Issue , 1999, Pages 404-413

  Koutsoupias1, Elias ^a   Papadimitriou, Christos ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMON RESOURCES; NASH EQUILIBRIA; NON-COOPERATIVE AGENTS; SIMPLE NETWORKS; SOCIAL OPTIMUMS; UPPER AND LOWER BOUNDS;

TELECOMMUNICATION NETWORKS;

EID: 84864657941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

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, and 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. Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1):91-103, 1980.
3. S. Floyd and K. Fall. Router Mechanisms to Support End-to-End Congestion Control. Technical report, Lawrence Berkeley National Laboratory, February 1997.
4. G. R. Grimmet and D. R. Stirzaker. Probability and Random Processes, 2nd ed.. Oxford University Press, 1992.
5. Y. Korilis and A. Lazar. On the existence of equilibria in noncooperative optimal flow control. Journal of the ACM 42(3):584-613, 1995.
6. Y. Korilis, A. Lazar, A. Orda. Architecting noncooperative networks. IEEE J. Selected Areas of Comm., 13, 7, 1995.
7. R. La, V. Anantharam. Optimal routing control: Game theoretic approach. Proc. 1997 CDC Conf.
8. G. Owen. Game Theory, 3rd ed.. Academic Press, 1995.
9. K. Park, M. Sitharam, S. Chen. Quality of service provision in noncooperative network environments. Manuscript, Purdue Univ., 1998.
10. C. H. Papadimitriou, M. Yannakakis. On complexity as bounded rationality. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 726-733, Montreal, Quebec, Canada, 23-25 May 1994.
11. S. J. Shenker. Making greed work in networks: a game-theoretic analysis of switch service disciplines. IEEE/ACM Transactions on Networking, 3(6):819-831, Dec. 1995.
12. S. Shenker, D. Clark, D. Estrin, and S. Herzog. Pricing in Computer Network: Reshaping the Research Agenda. Communications Policy, 20(1), 1996.