On the Price of Anarchy of Restricted Job Scheduling Games
暂无分享,去创建一个
[1] Csaba D. Tóth,et al. Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.
[2] Ronald Fagin,et al. Proceedings of the thirty-seventh annual ACM symposium on Theory of computing , 2005, STOC 2005.
[3] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[4] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[5] Ioannis Caragiannis,et al. Tight Bounds for Selfish and Greedy Load Balancing , 2006, Algorithmica.
[6] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[7] Yossi Azar,et al. Tradeoffs in worst-case equilibria , 2003, Theor. Comput. Sci..
[8] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[9] Csaba D. Tóth,et al. Uncoordinated Load Balancing and Congestion Games in P2P Systems , 2004, IPTPS.
[10] Paul W. Goldberg,et al. Utilitarian resource assignment , 2004, J. Discrete Algorithms.
[11] Ioannis Caragiannis,et al. Tight Bounds for Selfish and Greedy Load Balancing , 2006, ICALP.
[12] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[13] Y. Mansour,et al. On Nash Equilibria for a Network Creation Game , 2006, TEAC.
[14] Yishay Mansour,et al. Convergence Time to Nash Equilibria , 2003, ICALP.
[15] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[16] Yossi Azar,et al. The Price of Routing Unsplittable Flow , 2005, STOC '05.
[17] Rüdiger Reischuk,et al. Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science , 1996 .
[18] Martin Hoefer,et al. The Influence of Link Restrictions on (Random) Selfish Routing , 2008, SAGT.