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 条
  • [41] Bias and Overtaking Equilibria for Zero-Sum Stochastic Differential Games
    Beatris Escobedo-Trujillo
    Daniel López-Barrientos
    Onésimo Hernández-Lerma
    Journal of Optimization Theory and Applications, 2012, 153 : 662 - 687
  • [42] Competing Against Equilibria in Zero-Sum Games with Evolving Payoffs
    Cardoso, Adrian Rivera
    Abernethy, Jacob
    Wang, He
    Xu, Huan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [43] Bias and Overtaking Equilibria for Zero-Sum Stochastic Differential Games
    Escobedo-Trujillo, Beatris
    Lopez-Barrientos, Daniel
    Hernandez-Lerma, Onesimo
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2012, 153 (03) : 662 - 687
  • [44] Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead
    Kroer, Christian
    Farina, Gabriele
    Sandholm, Tuomas
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 1130 - 1137
  • [45] Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games
    Zhang, Brian Hu
    Sandholm, Tuomas
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [46] Strategic decompositions of normal form games: Zero-sum games and potential games
    Hwang, Sung-Ha
    Rey-Bellet, Luc
    GAMES AND ECONOMIC BEHAVIOR, 2020, 122 : 370 - 390
  • [47] Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
    Lou, Youcheng
    Hong, Yiguang
    Xie, Lihua
    Shi, Guodong
    Johansson, Karl Henrik
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (10) : 2920 - 2935
  • [48] Coarse Correlation in Extensive-Form Games
    Farina, Gabriele
    Bianchi, Tommaso
    Sandholm, Tuomas
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1934 - 1941
  • [49] Strategic negotiations for extensive-form games
    Dave de Jonge
    Dongmo Zhang
    Autonomous Agents and Multi-Agent Systems, 2020, 34
  • [50] Strategic negotiations for extensive-form games
    de Jonge, Dave
    Zhang, Dongmo
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2020, 34 (01)