The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds
暂无分享,去创建一个
[1] Y. Mansour,et al. Algorithmic Game Theory: Learning, Regret Minimization, and Equilibria , 2007 .
[2] Avrim Blum,et al. Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games , 2006, PODC '06.
[3] Stefano Leonardi,et al. Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.
[4] Georgia Perakis,et al. The "Price of Anarchy" Under Nonlinear and Asymmetric Costs , 2007, Math. Oper. Res..
[5] José R. Correa,et al. A Geometric Approach to the Price of Anarchy in Nonatomic Congestion Games , 2008, Games Econ. Behav..
[6] Y. Mansour,et al. 4 Learning , Regret minimization , and Equilibria , 2006 .
[7] 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..
[8] G. Perakis,et al. The Price of Anarchy when Costs Are Non-separable and Asymmetric , 2004, IPCO.
[9] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[10] José R. Correa,et al. On the Inefficiency of Equilibria in Congestion Games , 2005, IPCO.
[11] Tobias Harks,et al. Stackelberg Strategies and Collusion in Network Games with Splittable Flow , 2009, Theory of Computing Systems.
[12] Elias Koutsoupias,et al. On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games , 2005, ESA.
[13] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[14] R. Aumann. Subjectivity and Correlation in Randomized Strategies , 1974 .
[15] Mohammad Taghi Hajiaghayi,et al. Regret minimization and the price of total anarchy , 2008, STOC.