The complexity of uniform Nash equilibria and related regular subgraph problems

被引：11
|
作者：
Bonifaci, Vincenzo [1 ,2 ]
Di Iorio, Ugo [2 ]
Laura, Luigi [2 ]
机构：
[1] Univ Aquila, Dipartimento Ingn Elettr, I-67040 Laquila, Italy
[2] Sapienza Univ Roma, Dipartimento Informat & Sistemist, I-00185 Rome, Italy
来源：
THEORETICAL COMPUTER SCIENCE | 2008年 / 401卷 / 1-3期
关键词：
computational complexity; NP-completeness; uniform Nash equilibrium; regular induced subgraph;
D O I：
10.1016/j.tcs.2008.03.036
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose bimatrix games, deciding the existence of such uniform equilibria is an NP-complete problem. Our proof is graph-theoretical. Motivated by this result, we also give NP-completeness results for the problems of finding regular induced subgraphs of large size or regularity, which can be of independent interest. (c) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：144 / 152
页数：9
相关论文
共 50 条
  • [1] On the complexity of uniformly mixed nash equilibria and related regular subgraph problems
    Bonifaci, V
    Di Iorio, U
    Laura, L
    [J]. FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 197 - 208
  • [2] THE COMPLEXITY OF REGULAR SUBGRAPH RECOGNITION
    CHEAH, F
    CORNEIL, DG
    [J]. DISCRETE APPLIED MATHEMATICS, 1990, 27 (1-2) : 59 - 68
  • [3] On the complexity of some subgraph problems
    Scozzari, Andrea
    Tardella, Fabio
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (17) : 3531 - 3539
  • [4] Complexity of Rational and Irrational Nash Equilibria
    Bilo, Vittorio
    Mavronicolas, Marios
    [J]. THEORY OF COMPUTING SYSTEMS, 2014, 54 (03) : 491 - 527
  • [5] Complexity of Strategies and Multiplicity of Nash Equilibria
    Kalyan Chatterjee
    [J]. Group Decision and Negotiation, 2002, 11 : 223 - 230
  • [6] Query Complexity of Approximate Nash Equilibria
    Babichenko, Yakov
    [J]. JOURNAL OF THE ACM, 2016, 63 (04)
  • [7] On the communication complexity of approximate Nash equilibria
    Goldberg, Paul W.
    Pastink, Arnoud
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2014, 85 : 19 - 31
  • [8] Complexity of Rational and Irrational Nash Equilibria
    Bilo, Vittorio
    Mavronicolas, Marios
    [J]. ALGORITHMIC GAME THEORY, 2011, 6982 : 200 - +
  • [9] Complexity of strategies and multiplicity of Nash equilibria
    Chatterjee, K
    [J]. GROUP DECISION AND NEGOTIATION, 2002, 11 (03) : 223 - 230
  • [10] Nash equilibria: Complexity, symmetries, and approximation
    Daskalakis, Constantinos
    [J]. COMPUTER SCIENCE REVIEW, 2009, 3 (02) : 87 - 100
12345