Improved equilibria via public service advertising
暂无分享,去创建一个
Maria-Florina Balcan | Yishay Mansour | Avrim Blum | Y. Mansour | A. Blum | Maria-Florina Balcan | Avrim Blum
[1] Editors , 1986, Brain Research Bulletin.
[2] L. Shapley,et al. Potential Games , 1994 .
[3] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[4] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[5] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[6] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[7] José R. Correa,et al. Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .
[8] Paul G. Spirakis,et al. Selfish unsplittable flows , 2005, Theor. Comput. Sci..
[9] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[10] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[11] Elias Koutsoupias,et al. The price of anarchy of finite congestion games , 2005, STOC '05.
[12] Y. Mansour,et al. On Nash Equilibria for a Network Creation Game , 2006, TEAC.
[13] Vahab S. Mirrokni,et al. Convergence and approximation in potential games , 2006, Theor. Comput. Sci..
[14] Yishay Mansour,et al. Strong price of anarchy , 2007, SODA '07.
[15] Morteza Zadimoghaddam,et al. The price of anarchy in network creation games , 2007, PODC '07.
[16] Yishay Mansour,et al. Convergence time to Nash equilibrium in load balancing , 2007, TALG.
[17] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[18] David P. Williamson,et al. Stackelberg thresholds in network routing games or the value of altruism , 2007, EC '07.
[19] Claire Mathieu,et al. Online multicast with egalitarian cost sharing , 2008, SPAA '08.
[20] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .