Query Complexity of Approximate Nash Equilibria

被引：17
|
作者：
Babichenko, Yakov [1 ]
机构：
[1] Technion Israel Inst Technol, Dept Ind Engn & Management, IL-32000 Haifa, Israel
来源：
JOURNAL OF THE ACM | 2016年 / 63卷 / 04期
关键词：
Exact and Approximate Computation of Equilibria; Convergence and Learning in Games; Query complexity; approximate Nash equilibrium; adaptive dynamics; rate of convergence; GAMES;
D O I：
10.1145/2908734
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players n. Our main result states that for n-player binary-action games and for constant epsilon, the query complexity of an epsilon-well-supported Nash equilibrium is exponential in n. As a consequence of this result, we get an exponential lower bound on the rate of convergence of adaptive dynamics to approximate Nash equilibria.
引用
收藏
页数：24
相关论文
共 50 条
  • [41] Inapproximability results for constrained approximate Nash equilibria
    Deligkas, Argyrios
    Fearnley, John
    Savani, Rahul
    [J]. INFORMATION AND COMPUTATION, 2018, 262 : 40 - 56
  • [42] Computing Approximate Nash Equilibria in Polymatrix Games
    Argyrios Deligkas
    John Fearnley
    Rahul Savani
    Paul Spirakis
    [J]. Algorithmica, 2017, 77 : 487 - 514
  • [43] New complexity results about Nash equilibria
    Conitzer, Vincent
    Sandholm, Tuomas
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2008, 63 (02) : 621 - 641
  • [44] THE COMPLEXITY OF NASH EQUILIBRIA IN STOCHASTIC MULTIPLAYER GAMES
    Ummels, Michael
    Wojtczak, Dominik
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (03)
  • [45] The complexity of Nash equilibria in infinite multiplayer games
    Ummels, Michael
    [J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2008, 4962 : 20 - 34
  • [46] On the complexity of constrained Nash equilibria in graphical games
    Greco, Gianluigi
    Scarcello, Francesco
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3901 - 3924
  • [47] ON THE COMPLEXITY OF NASH EQUILIBRIA AND OTHER FIXED POINTS
    Etessami, Kousha
    Yannakakis, Mihalis
    [J]. SIAM JOURNAL ON COMPUTING, 2010, 39 (06) : 2531 - 2597
  • [48] Computing nash equilibria: Approximation and smoothed complexity
    Chen, Xi
    Deng, Xiaotie
    Teng, Shang-Hua
    [J]. 47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 603 - +
  • [49] Computing approximate Nash equilibria in network congestion games
    Feldmann, Andreas Emil
    Roeglin, Heiko
    Voecking, Berthold
    [J]. NETWORKS, 2012, 59 (04) : 380 - 386
  • [50] An algorithm for finding approximate Nash equilibria in bimatrix games
    Lunshan Gao
    [J]. Soft Computing, 2021, 25 : 1181 - 1191
12345