Tradeoffs in worst-case equilibria
暂无分享,去创建一个
Yossi Azar | Baruch Awerbuch | Dekel Tsur | Yossi Richter | B. Awerbuch | Y. Azar | Dekel Tsur | Yossi Richter
[1] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[2] Paul G. Spirakis,et al. The price of selfish routing , 2001, STOC '01.
[3] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[4] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[5] Tim Roughgarden. The price of anarchy is independent of the network topology , 2003, J. Comput. Syst. Sci..
[6] Tim Roughgarden,et al. How unfair is optimal routing? , 2002, SODA '02.
[7] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[8] Richard Cole,et al. How much can taxes help selfish routing? , 2003, EC '03.
[9] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[10] Richard Cole,et al. Pricing network edges for heterogeneous selfish users , 2003, STOC '03.
[11] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[12] Tim Roughgarden,et al. Designing networks for selfish users is hard , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.