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

DOI10.3390/G9020033MaRDI QIDQ1651920zbMATH OpenOpenAlexWikidataFDO

Authors Sam Ganzfried, Austin Nowak, Joannier Pinales

Publication date 10 July 2018

Published in Games (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

game theoryartificial intelligenceNash equilibriumimperfect information

Mathematics Subject Classification ID

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

Abstract: Creating strong agents for games with more than two players is a major open problem in AI. Common approaches are based on approximating game-theoretic solution concepts such as Nash equilibrium, which have strong theoretical guarantees in two-player zero-sum games, but no guarantees in non-zero-sum games or in games with more than two players. We describe an agent that is able to defeat a variety of realistic opponents using an exact Nash equilibrium strategy in a 3-player imperfect-information game. This shows that, despite a lack of theoretical guarantees, agents based on Nash equilibrium strategies can be successful in multiplayer games after all.

Recommendations

• scientific article; zbMATH DE number 1329116
• Dynamics of three-agent games
• scientific article; zbMATH DE number 1998538
• scientific article; zbMATH DE number 2186530
• Publication:4504050
• Coalition-proof Nash equilibria and the core in three-player games
• scientific article; zbMATH DE number 1738583
• A three-person deterministic graphical game without Nash equilibria
• Approximate Nash Equilibria for Multi-player Games
• Perfect equilibria in games of incomplete information

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 1946858 (Why is no real title available?)
• Three-player game-theoretic allocation of indivisible resources during natural disasters
• Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
• A survey of opponent modeling in adversarial domains

Describes a project that uses

Uses Software

• DeepStack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1651920)