Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
暂无分享,去创建一个
Maria-Florina Balcan | Yishay Mansour | Avrim Blum | Y. Mansour | A. Blum | Maria-Florina Balcan | M. Balcan | Avrim Blum
[1] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[2] Heinrich von Stackelberg. theory of the market economy , 1952 .
[3] R. Stephenson. A and V , 1962, The British journal of ophthalmology.
[4] Peter Secretan. Learning , 1965, Mental Health.
[5] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[6] V. Benassi. CHAPTER 4 – LEARNING , 1981 .
[7] Editors , 1986, Brain Research Bulletin.
[8] Bernard Widrow,et al. Adaptive switching circuits , 1988 .
[9] Manfred K. Warmuth,et al. The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.
[10] Philip M. Long,et al. On-line learning of linear functions , 1991, STOC '91.
[11] David Haussler,et al. How to use expert advice , 1993, STOC.
[12] L. Blume. The Statistical Mechanics of Strategic Interaction , 1993 .
[13] L. Shapley,et al. Potential Games , 1994 .
[14] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[15] Dean P. Foster,et al. Calibrated Learning and Correlated Equilibrium , 1997 .
[16] S. Hart,et al. A simple adaptive procedure leading to correlated equilibrium , 2000 .
[17] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[18] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[19] Dean P. Foster,et al. Regret in the On-Line Decision Problem , 1999 .
[20] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[21] S. Hart,et al. A Reinforcement Procedure Leading to Correlated Equilibrium , 2001 .
[22] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[23] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[24] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[25] Richard Cole,et al. How much can taxes help selfish routing? , 2003, EC '03.
[26] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[27] Richard Cole,et al. Pricing network edges for heterogeneous selfish users , 2003, STOC '03.
[28] Lawrence E. Blume,et al. How noise matters , 2003, Games Econ. Behav..
[29] José R. Correa,et al. Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .
[30] Paul G. Spirakis,et al. Selfish unsplittable flows , 2005, Theor. Comput. Sci..
[31] 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.
[32] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[33] Elias Koutsoupias,et al. The price of anarchy of finite congestion games , 2005, STOC '05.
[34] Gábor Lugosi,et al. Internal Regret in On-Line Portfolio Selection , 2005, Machine Learning.
[35] Yishay Mansour,et al. On nash equilibria for a network creation game , 2014, SODA '06.
[36] Y. Mansour,et al. 4 Learning , Regret minimization , and Equilibria , 2006 .
[37] Trevor Darrell,et al. Nearest-Neighbor Searching and Metric Space Dimensions , 2006 .
[38] Richard Cole,et al. How much can taxes help selfish routing? , 2006, J. Comput. Syst. Sci..
[39] Berthold Vöcking,et al. On the Impact of Combinatorial Structure on Congestion Games , 2006, FOCS.
[40] Vahab S. Mirrokni,et al. Convergence and approximation in potential games , 2006, Theor. Comput. Sci..
[41] Yishay Mansour,et al. Strong price of anarchy , 2007, SODA '07.
[42] Morteza Zadimoghaddam,et al. The price of anarchy in network creation games , 2007, PODC '07.
[43] Yishay Mansour,et al. Convergence time to Nash equilibrium in load balancing , 2007, TALG.
[44] David P. Williamson,et al. Stackelberg thresholds in network routing games or the value of altruism , 2007, EC '07.
[45] Guy Kortsarz,et al. Improved approximating algorithms for Directed Steiner Forest , 2009, SODA.
[46] Claire Mathieu,et al. Online multicast with egalitarian cost sharing , 2008, SPAA '08.
[47] Yossi Azar,et al. Fast convergence to nearly optimal solutions in potential games , 2008, EC '08.
[48] Mohammad Taghi Hajiaghayi,et al. Regret minimization and the price of total anarchy , 2008, STOC.
[49] Angelo Fanelli,et al. The Speed of Convergence in Congestion Games under Best-Response Dynamics , 2008, ICALP.
[50] Anupam Gupta,et al. Set connectivity problems in undirected graphs and the directed Steiner network problem , 2008, SODA 2008.
[51] Maria-Florina Balcan,et al. Improved equilibria via public service advertising , 2009, SODA.
[52] Maria-Florina Balcan,et al. The Price of Uncertainty , 2009, TEAC.
[53] Sarit Kraus,et al. Using Game Theory for Los Angeles Airport Security , 2009, AI Mag..
[54] Éva Tardos,et al. Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract , 2009, STOC '09.
[55] Jason R. Marden,et al. Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation , 2010 .
[56] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[57] Morteza Zadimoghaddam,et al. Constant Price of Anarchy in Network Creation Games via Public Service Advertising , 2010, WAW.
[58] Jason R. Marden,et al. Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[59] Vincent Conitzer,et al. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.
[60] Maria-Florina Balcan,et al. Near Optimality in Covering and Packing Games by Exposing Global Information , 2011, ArXiv.
[61] T. Roughgarden. Intrinsic robustness of the price of anarchy , 2012, Commun. ACM.
[62] Angelo Fanelli,et al. The speed of convergence in congestion games under best-response dynamics , 2008, TALG.