Complexity of strategies and multiplicity of Nash equilibria

被引：1
|
作者：
Chatterjee, K [1 ]
机构：
[1] Penn State Univ, University Pk, PA 16802 USA
来源：
GROUP DECISION AND NEGOTIATION | 2002年 / 11卷 / 03期
关键词：
D O I：
10.1023/A:1015236512713
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：223 / 230
页数：8
相关论文
共 50 条
  • [41] The game world is flat: The complexity of Nash equilibria in succinct games
    Daskalakis, Constantinos
    Fabrikant, Alex
    Papadimitriou, Christos H.
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 513 - 524
  • [42] On the complexity of Nash equilibria and other fixed points (extended abstract
    Etessami, Kousha
    Yannakakis, Mihalis
    48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, : 113 - +
  • [43] Quantum game theory and the complexity of approximating quantum Nash equilibria
    Bostanci, John
    Watrous, John
    QUANTUM, 2022, 6
  • [44] The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
    Fischer, Felix
    Holzer, Markus
    Katzenbeisser, Stefan
    INFORMATION PROCESSING LETTERS, 2006, 99 (06) : 239 - 245
  • [45] Complexity and Efficiency of Nash Equilibria in Noncooperative Simple Platoon Games
    Ibrahim, Adrianto Ravi
    Cetinkaya, Ahmet
    Kishida, Masako
    2022 IEEE 61ST CONFERENCE ON DECISION AND CONTROL (CDC), 2022, : 4449 - 4454
  • [46] Quantum game theory and the complexity of approximating quantum Nash equilibria
    Bostanci, John
    Watrous, John
    QUANTUM, 2022, 6
  • [47] On Nash Equilibria in a Finite Game for Fuzzy Sets of Strategies
    Bekesiene, Svajone
    Mashchenko, Serhii
    MATHEMATICS, 2023, 11 (22)
  • [48] On the computational complexity of Nash equilibria for (0,1) bimatrix games
    Codenotti, B
    Stefankovic, D
    INFORMATION PROCESSING LETTERS, 2005, 94 (03) : 145 - 150
  • [49] On the complexity of uniformly mixed nash equilibria and related regular subgraph problems
    Bonifaci, V
    Di Iorio, U
    Laura, L
    FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 197 - 208
  • [50] Settling the complexity of computing approximate two-player Nash equilibria
    Rubistein, Aviad
    2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 258 - 265
12345