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 条
  • [1] Query Complexity of Approximate Nash Equilibria
    Babichenko, Yakov
    [J]. STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 535 - 544
  • [2] On the communication complexity of approximate Nash equilibria
    Goldberg, Paul W.
    Pastink, Arnoud
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2014, 85 : 19 - 31
  • [3] Communication complexity of approximate Nash equilibria
    Babichenko, Yakov
    Rubinstein, Aviad
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2022, 134 : 376 - 398
  • [4] Communication Complexity of Approximate Nash Equilibria
    Babichenko, Yakov
    Rubinstein, Aviad
    [J]. STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 878 - 889
  • [5] Query complexity of approximate equilibria in anonymous games
    Goldberg, Paul W.
    Turchetta, Stefano
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 90 : 80 - 98
  • [6] Logarithmic Query Complexity for Approximate Nash Computation in Large Games
    Goldberg, Paul W.
    Marmolejo-Cossio, Francisco J.
    Wu, Zhiwei Steven
    [J]. THEORY OF COMPUTING SYSTEMS, 2019, 63 (01) : 26 - 53
  • [7] Logarithmic Query Complexity for Approximate Nash Computation in Large Games
    Goldberg, Paul W.
    Cossio, Francisco J. Marmolejo
    Wu, Zhiwei Steven
    [J]. ALGORITHMIC GAME THEORY, SAGT 2016, 2016, 9928 : 3 - 14
  • [8] Logarithmic Query Complexity for Approximate Nash Computation in Large Games
    Paul W. Goldberg
    Francisco J. Marmolejo-Cossío
    Zhiwei Steven Wu
    [J]. Theory of Computing Systems, 2019, 63 : 26 - 53
  • [9] Settling the complexity of computing approximate two-player Nash equilibria
    Rubistein, Aviad
    [J]. 2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 258 - 265
  • [10] Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games
    Hadiji, Hedi
    Sachs, Sarah
    van Even, Tim
    Koolen, Wouter
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
12345