Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games

被引:4
|
作者
Cermak, Jiri [1 ]
Bosansky, Branislav [1 ]
Lisy, Viliam [1 ]
机构
[1] Czech Tech Univ, Fac Elect Engn, Agent Technol Ctr, Prague, Czech Republic
关键词
D O I
10.3233/978-1-61499-419-0-201
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nash equilibrium (NE) is the best known solution concept used in game theory. It is known that NE is particularly weak even in zero-sum extensive-form games since it can prescribe irrational actions to play that do not exploit mistakes made by an imperfect opponent. These issues are addressed by a number of refinements of NE that strengthen the requirements for equilibrium strategies. However, a thorough experimental analysis of practical performance of the Nash equilibria refinement strategies is, to the best of our knowledge, missing. This paper aims to fill this void and provides the first broader experimental comparison of the quality of refined Nash strategies in zero-sum extensive-form games. The experimental results suggest that (1) there is a significant difference between the best and the worst NE strategy against imperfect opponents, (2) the existing refinements outperform the worst NE strategy, (3) they typically perform close to the best possible NE strategy, and (4) the difference in performance of all compared refinements is very small.
引用
收藏
页码:201 / +
页数:2
相关论文
共 50 条
  • [21] Safe Search for Stackelberg Equilibria in Extensive-Form Games
    Ling, Chun Kai
    Brown, Noam
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5541 - 5548
  • [22] Zero-Sum Game Techniques for Approximate Nash Equilibria
    Czumaj, Artur
    Fasoulakis, Michail
    Jurdzinski, Marcin
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 1514 - 1516
  • [23] Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games
    Cerny, Jakub
    Bosansky, Branislav
    Kiekintveld, Christopher
    ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2018, : 151 - 168
  • [24] Theoretical and Practical Advances on Smoothing for Extensive-Form Games
    Kroer, Christian
    Waugh, Kevin
    Kilinc-Karzan, Fatma
    Sandholm, Tuomas
    EC'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2017, : 693 - 693
  • [25] Symmetric zero-sum games with only asymmetric equilibria
    Xefteris, Dimitrios
    GAMES AND ECONOMIC BEHAVIOR, 2015, 89 : 122 - 125
  • [26] Almost Stationary ∈-Equilibria in Zero-Sum Stochastic Games
    J. Flesch
    F. Thuijsman
    O. J. Vrieze
    Journal of Optimization Theory and Applications, 2000, 105 : 371 - 389
  • [27] Almost stationary ε-equilibria in zero-sum stochastic games
    Flesch, J
    Thuijsman, F
    Vrieze, OJ
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 105 (02) : 371 - 389
  • [28] Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games
    Piliouras, Georgios
    Ratliff, Lillian
    Sim, Ryann
    Skoulakis, Stratis
    ALGORITHMIC GAME THEORY, SAGT 2022, 2022, 13584 : 383 - 399
  • [29] Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games
    Bosansky, Branislav
    Cermak, Jiri
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 805 - 811
  • [30] RATIONALITY IN EXTENSIVE-FORM GAMES
    RENY, PJ
    JOURNAL OF ECONOMIC PERSPECTIVES, 1992, 6 (04): : 103 - 118