On the convergence of the best-response algorithm in routing games
暂无分享,去创建一个
[1] Tim Roughgarden,et al. Intrinsic Robustness of the Price of Anarchy , 2015, J. ACM.
[2] George B. Mertzios,et al. Fast Convergence of Routing Games with Splittable Flows , 2008, TMFCS 2008.
[3] Ephraim Zehavi,et al. Cooperative Game Theory and the Gaussian Interference Channel , 2007, IEEE Journal on Selected Areas in Communications.
[4] Antonio Fernández,et al. A mathematical model for the TCP Tragedy of the Commons , 2005, Theor. Comput. Sci..
[5] Kim C. Border,et al. Fixed point theorems with applications to economics and game theory: Fixed point theorems for correspondences , 1985 .
[6] Srinivasan Seshan,et al. Selfish behavior and stability of the internet: a game-theoretic analysis of TCP , 2002, SIGCOMM.
[7] Eitan Altman,et al. A survey on networking games in telecommunications , 2006, Comput. Oper. Res..
[8] Jigen Peng,et al. A new stability criterion for discrete-time neural networks: Nonlinear spectral radius , 2007 .
[9] Ariel Orda,et al. Competitive routing in multi-user communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[10] R. Michael Buehrer,et al. A game-theoretic framework for interference avoidance , 2009, IEEE Transactions on Communications.
[11] Athanasios D. Panagopoulos,et al. A survey on game theory applications in wireless networks , 2010, Comput. Networks.
[12] Tim Roughgarden,et al. The price of anarchy in an exponential multi-server , 2007, Oper. Res. Lett..
[13] Balakrishna J. Prabhu,et al. Price of anarchy in non-cooperative load balancing games , 2011, Perform. Evaluation.
[14] Michal Feldman,et al. Dynamic Inefficiency: Anarchy without Stability , 2011, SAGT.
[15] Idit Keidar,et al. EquiCast: Scalable multicast with selfish users , 2009, Comput. Networks.
[16] D. Starobinski,et al. On the price of anarchy in unbounded delay networks , 2006, GameNets '06.
[17] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[18] Michael Frazier,et al. Studies in Advanced Mathematics , 2004 .
[19] Ming-Deh A. Huang,et al. Proof of proposition 2 , 1992 .
[20] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[21] Yang Wang,et al. Bounded semigroups of matrices , 1992 .
[22] Scott Shenker,et al. Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1995, TNET.
[23] Eitan Altman,et al. Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms , 2001, J. Parallel Distributed Comput..
[24] L. Evans. Measure theory and fine properties of functions , 1992 .
[25] José R. Correa,et al. The Impact of Oligopolistic Competition in Networks , 2009, Oper. Res..
[26] J. Theys. Joint spectral radius : theory and approximations/ , 2005 .
[27] Rahul Garg,et al. A game-theoretic approach towards congestion control in communication networks , 2002, CCRV.
[28] Richard S. Varga,et al. Proof of Theorem 5 , 1983 .
[29] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[30] Tim Roughgarden. The price of anarchy is independent of the network topology , 2003, J. Comput. Syst. Sci..
[31] Bruno Gaujal,et al. Optimal routing in parallel, non-observable queues and the price of anarchy revisited , 2010, 2010 22nd International Teletraffic Congress (lTC 22).
[32] Yishay Mansour,et al. Convergence Time to Nash Equilibria , 2003, ICALP.
[33] Richard S. Varga,et al. Proof of Theorem 6 , 1983 .
[34] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[35] Ming-Deh A. Huang,et al. Proof of proposition 1 , 1992 .
[36] Ariel Orda,et al. Competitive routing in multiuser communication networks , 1993, TNET.
[37] Vahab S. Mirrokni,et al. Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[38] Adam Wierman,et al. The effect of local scheduling in load balancing designs , 2008, PERV.