Intrinsic Robustness of the Price of Anarchy
暂无分享,去创建一个
[1] Haim Kaplan,et al. Non-price equilibria in markets of discrete goods , 2011, EC '11.
[2] Tobias Harks,et al. Stackelberg Strategies and Collusion in Network Games with Splittable Flow , 2009, Theory of Computing Systems.
[3] Tim Roughgarden,et al. Restoring Pure Equilibria to Weighted Congestion Games , 2011, ICALP.
[4] Marios Mavronicolas,et al. A new model for selfish routing , 2008, Theor. Comput. Sci..
[5] Noga Alon,et al. Basic Network Creation Games , 2013, SIAM J. Discret. Math..
[6] S. Fischer. Selfish Routing , 2002 .
[7] Martin Gairing,et al. Routing (un-) splittable flow in games with player-specific affine latency functions , 2011, TALG.
[8] Itai Ashlagi,et al. On the Value of Correlation , 2005, UAI.
[9] H. Peyton Young,et al. Strategic Learning and Its Limits , 2004 .
[10] Neil Olver,et al. The Price of Anarchy and a Priority-Based Model of Routing , 2006 .
[11] Y. Mansour,et al. Algorithmic Game Theory: Learning, Regret Minimization, and Equilibria , 2007 .
[12] José R. Correa,et al. Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .
[13] José R. Correa,et al. Decentralized utilitarian mechanisms for scheduling games , 2015, Games Econ. Behav..
[14] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.
[15] Éva Tardos,et al. Composable and efficient mechanisms , 2012, STOC '13.
[16] Dimitris Fotakis,et al. Stackelberg Strategies for Atomic Congestion Games , 2007, Theory of Computing Systems.
[17] Vahab S. Mirrokni,et al. Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[18] Tim Roughgarden,et al. Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness , 2014, TEAC.
[19] Stefan Schmid,et al. When selfish meets evil: byzantine players in a virus inoculation game , 2006, PODC '06.
[20] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[21] Steve Chien,et al. Strong and Pareto Price of Anarchy in Congestion Games , 2009, ICALP.
[22] Ioannis Caragiannis,et al. Tight Bounds for Selfish and Greedy Load Balancing , 2006, Algorithmica.
[23] Elliot Anshelevich,et al. Assignment Games with Conflicts: Price of Total Anarchy and Convergence Results via Semi-Smoothness , 2013, ArXiv.
[24] Berthold Vöcking,et al. On the Impact of Combinatorial Structure on Congestion Games , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[25] T. Koopmans,et al. Studies in the Economics of Transportation. , 1956 .
[26] J. Vial,et al. Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon , 1978 .
[27] Renato Paes Leme,et al. GSP auctions with correlated types , 2011, EC '11.
[28] Berthold Vöcking,et al. Inapproximability of pure nash equilibria , 2008, STOC.
[29] Moshe Babaioff,et al. Congestion games with malicious players , 2009, Games Econ. Behav..
[30] Tobias Harks. Stackelberg Strategies and Collusion in Network Games with Splittable Flow , 2008, WAOA.
[31] Renato Paes Leme,et al. Bounding the inefficiency of outcomes in generalized second price auctions , 2012, J. Econ. Theory.
[32] Christos H. Papadimitriou,et al. Computing correlated equilibria in multi-player games , 2005, STOC '05.
[33] José R. Correa,et al. A Geometric Approach to the Price of Anarchy in Nonatomic Congestion Games , 2008, Games Econ. Behav..
[34] Yishay Mansour,et al. Strong equilibrium in cost sharing connection games , 2007, EC '07.
[35] Rudolf Müller,et al. Games and Mechanism Design in Machine Scheduling – An Introduction , 2009 .
[36] É. Tardos,et al. Algorithmic Game Theory: Network Formation Games and the Potential Function Method , 2007 .
[37] Vasilis Syrgkanis,et al. Bayesian Games and the Smoothness Framework , 2012, ArXiv.
[38] R. Aumann. Correlated Equilibrium as an Expression of Bayesian Rationality Author ( s ) , 1987 .
[39] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[40] Adrian Vetta,et al. A Priority-Based Model of Routing , 2008, Chic. J. Theor. Comput. Sci..
[41] Marios Mavronicolas,et al. A new model for selfish routing , 2004, Theor. Comput. Sci..
[42] Umang Bhaskar,et al. Routing games , 2012 .
[43] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[44] J. G. Wardrop,et al. Some Theoretical Aspects of Road Traffic Research , 1952 .
[45] Dimitris Fotakis. Stackelberg Strategies for Atomic Congestion Games , 2007, ESA.
[46] Dimitris Fotakis. Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy , 2009, Theory of Computing Systems.
[47] Tim Roughgarden. The price of anarchy is independent of the network topology , 2003, J. Comput. Syst. Sci..
[48] Paul G. Spirakis,et al. On the Performance of Approximate Equilibria in Congestion Games , 2008, Algorithmica.
[49] Marina Thottan,et al. Market sharing games applied to content distribution in ad hoc networks , 2006, IEEE J. Sel. Areas Commun..
[50] Angelo Fanelli,et al. On the Impact of Fair Best Response Dynamics , 2012, MFCS.
[51] Renato Paes Leme,et al. Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[52] László A. Végh,et al. Nonadaptive Selfish Routing with Online Demands , 2007, CAAN.
[53] Tim Roughgarden,et al. Generalized Efficiency Bounds in Distributed Resource Allocation , 2014, IEEE Trans. Autom. Control..
[54] Kamesh Munagala,et al. Coevolutionary opinion formation games , 2013, STOC '13.
[55] Kousha Etessami,et al. On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..
[56] Csaba D. Tóth,et al. Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.
[57] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[58] M. Safari. Price of Anarchy ⋆ , 2005 .
[59] Elias Koutsoupias,et al. Coordination mechanisms , 2009, Theor. Comput. Sci..
[60] S. Hart,et al. A simple adaptive procedure leading to correlated equilibrium , 2000 .
[61] Georgia Perakis,et al. The "Price of Anarchy" Under Nonlinear and Asymmetric Costs , 2007, Math. Oper. Res..
[62] Paul W. Goldberg,et al. The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..
[63] Yossi Azar,et al. Fast convergence to nearly optimal solutions in potential games , 2008, EC '08.
[64] Jon M. Kleinberg,et al. How Bad is Forming Your Own Opinion? , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[65] Allan Borodin,et al. Price of anarchy for greedy auctions , 2009, SODA '10.
[66] Adrian Vetta,et al. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[67] George Karakostas,et al. Equilibria for networks with malicious users , 2007, ISAAC.
[68] R. Holzman,et al. Strong Equilibrium in Congestion Games , 1997 .
[69] 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.
[70] Martin Gairing,et al. Price of Stability in Polynomial Congestion Games , 2013, TEAC.
[71] Po-An Chen,et al. Altruism and Its Impact on the Price of Anarchy , 2014, TEAC.
[72] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[73] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[74] Vittorio Bilò,et al. Performance of One-Round Walks in Linear Congestion Games , 2010, Theory of Computing Systems.
[75] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[76] Tim Roughgarden,et al. Local smoothness and the price of anarchy in atomic splittable congestion games , 2011, SODA '11.
[77] James Hannan,et al. 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .
[78] Éva Tardos,et al. Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract , 2009, STOC '09.
[79] Avrim Blum,et al. Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games , 2006, PODC '06.
[80] Aaron Roth,et al. The Price of Malice in Linear Congestion Games , 2008, WINE.
[81] Martin Gairing. Selfish routing in networks , 2006 .
[82] Vahab S. Mirrokni,et al. Convergence Issues in Competitive Games , 2004, APPROX-RANDOM.
[83] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[84] Eitan Zemel,et al. Nash and correlated equilibria: Some complexity considerations , 1989 .
[85] Dan Suciu,et al. Journal of the ACM , 2006 .
[86] L. Shapley,et al. REGULAR ARTICLEPotential Games , 1996 .
[87] R. Vohra,et al. Calibrated Learning and Correlated Equilibrium , 1996 .
[88] Steve Chien,et al. Convergence to approximate Nash equilibria in congestion games , 2007, SODA '07.
[89] Adam Meyerson,et al. On the price of mediation , 2009, EC '09.
[90] Xiaotie Deng,et al. Settling the complexity of computing two-player Nash equilibria , 2007, JACM.
[91] Renato Paes Leme,et al. On the efficiency of equilibria in generalized second price auctions , 2011, EC '11.
[92] Berthold Vöcking. Algorithmic Game Theory: Selfish Load Balancing , 2007 .
[93] Annamária Kovács,et al. Bayesian Combinatorial Auctions , 2008, ICALP.
[94] Martin Gairing,et al. Price of Anarchy for Polynomial Wardrop Games , 2006, WINE.
[95] Elias Koutsoupias,et al. On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games , 2005, ESA.
[96] Tim Roughgarden,et al. The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds , 2010, WINE.
[97] Johanne Cohen,et al. Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games , 2012, WINE.
[98] Éva Tardos,et al. Strong Price of Anarchy, Utility Games and Coalitional Dynamics , 2014, SAGT.
[99] Yishay Mansour,et al. On Nash Equilibria for a Network Creation Game , 2014, TEAC.
[100] Elias Koutsoupias,et al. The price of anarchy of finite congestion games , 2005, STOC '05.
[101] Tim Roughgarden,et al. Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..
[102] Martin Gairing,et al. Malicious Bayesian Congestion Games , 2008, WAOA.
[103] Brendan Lucier,et al. Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions , 2009, ICS.
[104] L. Shapley,et al. Potential Games , 1994 .
[105] R. Aumann. Subjectivity and Correlation in Randomized Strategies , 1974 .
[106] Martin Gairing,et al. Exact Price of Anarchy for Polynomial Congestion Games , 2006, STACS.
[107] Yossi Azar,et al. The Price of Routing Unsplittable Flow , 2005, STOC '05.
[108] Tim Roughgarden,et al. Local smoothness and the price of anarchy in splittable congestion games , 2015, J. Econ. Theory.
[109] Paul G. Spirakis,et al. Approximate Equilibria and Ball Fusion , 2003, Theory of Computing Systems.
[110] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[111] Chryssis Georgiou,et al. Selfish Routing in the Presence of Network Uncertainty , 2009, Parallel Process. Lett..
[112] Tim Roughgarden,et al. Welfare guarantees for combinatorial auctions with item bidding , 2011, SODA '11.
[113] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[114] Yishay Mansour,et al. Strong price of anarchy , 2007, SODA '07.
[115] Martin Gairing,et al. Selfish Routing with Incomplete Information , 2005, SPAA '05.
[116] Rolf H. Möhring,et al. Characterizing the Existence of Potential Functions in Weighted Congestion Games , 2011, Theory of Computing Systems.
[117] Po-An Chen,et al. The Robust Price of Anarchy of Altruistic Games , 2011, WINE.
[118] Mohammad Taghi Hajiaghayi,et al. Regret minimization and the price of total anarchy , 2008, STOC.
[119] Ruben Hoeksma,et al. The Price of Anarchy for Minsum Related Machine Scheduling , 2011, WAOA.
[120] Tim Roughgarden,et al. The price of anarchy in games of incomplete information , 2012, EC '12.
[121] Avrim Blum,et al. Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games , 2006, PODC '06.
[122] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.