Greediness and equilibrium in congestion games

被引:3
作者
Kuniavsky, Sergey [1 ]
Smorodinsky, Rann [2 ]
机构
[1] Univ Munich, Munich Grad Sch Econ, D-80539 Munich, Germany
[2] Technion Israel Inst Technol, Fac Ind Engn & Management, IL-32000 Haifa, Israel
关键词
Congestion games; Equilibrium; Greediness;
D O I
10.1016/j.econlet.2013.10.005
中图分类号
F [经济];
学科分类号
02 ;
摘要
We study the class of congestion games for which the set of Nash equilibrium is equivalent to the set of strategy profiles played by greedy myopic players. We show these two coincide iff such games are played over extension-parallel graphs. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:499 / 503
页数:5
相关论文
共 10 条
  • [1] On the Impact of Combinatorial Structure on Congestion Games
    Ackermann, Heiner
    Roegln, Heiko
    Voecking, Berthold
    [J]. JOURNAL OF THE ACM, 2008, 55 (06)
  • [2] [Anonymous], 1973, International J. of Game Theory, DOI 10.1007/BF01737559
  • [3] EPISTEMIC CONDITIONS FOR NASH EQUILIBRIUM
    AUMANN, R
    BRANDENBURGER, A
    [J]. ECONOMETRICA, 1995, 63 (05) : 1161 - 1180
  • [4] Fabrikant A., 2004, P 36 ACM S THEORY CO, P604, DOI DOI 10.1145/1007352.1007445
  • [5] Fotakis D, 2006, LECT NOTES COMPUT SC, V3879, P161
  • [6] Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
    Fotakis, Dimitris
    [J]. THEORY OF COMPUTING SYSTEMS, 2010, 47 (01) : 113 - 136
  • [7] Network structure and strong equilibrium in route selection games
    Holzman, R
    Law-yone, N
    [J]. MATHEMATICAL SOCIAL SCIENCES, 2003, 46 (02) : 193 - 205
  • [8] leong S., 2005, P 20 NAT C ART INT
  • [9] Network topology and the efficiency of equilibrium
    Milchtaich, Igal
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2006, 57 (02) : 321 - 346
  • [10] Potential games
    Monderer, D
    Shapley, LS
    [J]. GAMES AND ECONOMIC BEHAVIOR, 1996, 14 (01) : 124 - 143