Fast and Compact: A Simple Class of Congestion Games
暂无分享,去创建一个
Yoav Shoham | Samuel Ieong | Qixiang Sun | Eugene Nudelman | Robert McGrew | Y. Shoham | E. Nudelman | Qixiang Sun | R. McGrew | Samuel Ieong | Eugene Nudelman
[1] Tim Roughgarden,et al. The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.
[2] Daphne Koller,et al. Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.
[3] O. Rozenfeld. Strong Equilibrium in Congestion Games , 2007 .
[4] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[5] Mark Voorneveld,et al. Congestion Games and Potentials Reconsidered , 1999, IGTR.
[6] Moshe Tennenholtz,et al. Local-Effect Games , 2003, IJCAI.
[7] 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.
[8] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[9] Kevin Leyton-Brown,et al. Computing Nash Equilibria of Action-Graph Games , 2004, UAI.
[10] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[11] I. Milchtaich,et al. Congestion Games with Player-Specific Payoff Functions , 1996 .
[12] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[13] Vincent Conitzer,et al. Complexity Results about Nash Equilibria , 2002, IJCAI.
[14] Yishay Mansour,et al. Convergence Time to Nash Equilibria , 2003, ICALP.
[15] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.