Successful Nash equilibrium agent for a three-player imperfect-information game

DOI10.3390/g9020033zbMath1401.91018arXiv1804.04789OpenAlexW2797291350WikidataQ129710530 ScholiaQ129710530MaRDI QIDQ1651920

Joannier Pinales, Austin Nowak, Sam Ganzfried

Publication date: 10 July 2018

Published in: Games (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.04789

zbMATH Keywords

game theoryNash equilibriumartificial intelligenceimperfect information

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Agent technology and artificial intelligence (68T42)

Related Items (2)

Three-player game-theoretic allocation of indivisible resources during natural disasters ⋮ A Survey of Opponent Modeling in Adversarial Domains

Uses Software

• DeepStack

Cites Work

• Simple search methods for finding a Nash equilibrium
• The complexity of two-person zero-sum games in extensive form
• A global Newton method to compute Nash equilibria.
• Non-cooperative games
• DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
• Equilibrium Points of Bimatrix Games

This page was built for publication: Successful Nash equilibrium agent for a three-player imperfect-information game