论文信息 - Worst-case equilibria

Worst-case equilibria

In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a very simple network leads to some interesting mathematics, results, and open problems.

Christos H. Papadimitriou | Elias Koutsoupias | E. Koutsoupias | C. Papadimitriou

[1] Oscar H. Ibarra,et al. Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[2] G. Grimmett,et al. Probability and random processes , 2002 .

[3] Mihalis Yannakakis,et al. On complexity as bounded rationality (extended abstract) , 1994, STOC '94.

[4] Aurel A. Lazar,et al. On the existence of equilibria in noncooperative optimal flow control , 1995, JACM.

[5] Scott Shenker,et al. Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1995, TNET.

[6] Ariel Orda,et al. Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.

[7] S. Shenker,et al. Pricing in computer networks: reshaping the research agenda , 1996, CCRV.

[8] Kihong Park,et al. Quality of Service Provision in Noncooperative Network Environments , 1997 .

[9] Richard J. La,et al. Optimal routing control: game theoretic approach , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[10] Deborah Estrin,et al. Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[11] Kihong Park,et al. Quality of service provision in noncooperative networks: heterogenous preferences, multi-dimensional QoS vectors, and burstiness , 1998, ICE '98.