Worst-case equilibria

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 Owen, 1995 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 Korilis, 1995, On the existence of equilibria in noncooperative optimal flow control, Journal of the ACM, 42, 584, 10.1145/210346.210415 R. La, V. Anantharam, Optimal routing control: Game theoretic approach, in: Proc. 1997 CDC Conf. Shenker, 1995, Making greed work in networks: A game-theoretic analysis of switch service disciplines, IEEE/ACM Transactions on Networking, 3, 819, 10.1109/90.477727 Shenker, 1996, Pricing in computer network: Reshaping the research agenda, Communications Policy, 20 Korilis, 1995, Architecting noncooperative networks, IEEE Journal on Selected Areas of Communications, 13, 7, 10.1109/49.414643 Nisan, 2007 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 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 Motwani, 1995 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 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 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 Cho, 1980, Bounds for list schedules on uniform processors, SIAM Journal on Computing, 9, 91, 10.1137/0209007 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 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