Successful Nash equilibrium agent for a three-player imperfect-information game (Q1651920): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: DeepStack / rank | |||
Normal rank |
Revision as of 20:02, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Successful Nash equilibrium agent for a three-player imperfect-information game |
scientific article |
Statements
Successful Nash equilibrium agent for a three-player imperfect-information game (English)
0 references
10 July 2018
0 references
Summary: 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 three-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.
0 references
artificial intelligence
0 references
game theory
0 references
Nash equilibrium
0 references
imperfect information
0 references