Algorithms for computing strategies in two-player simultaneous move games

DOI10.1016/j.artint.2016.03.005zbMath1357.68203OpenAlexW2322232506WikidataQ59209595 ScholiaQ59209595MaRDI QIDQ286381

Branislav Bošanský, Marc Lanctot, Viliam Lisý, Mark H. M. Winands, Jiří Čermák

Publication date: 20 May 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.03.005

zbMATH Keywords

Nash equilibriumregret matchingbackward inductionalpha-beta pruningcounterfactual regret minimizationdouble-oracle algorithmgame playingMarkov gamesMonte Carlo tree searchsimultaneous move games

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Noncooperative games (91A10) 2-person games (91A05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Online algorithms; streaming algorithms (68W27)

Related Items

Approximating maxmin strategies in imperfect recall games using A-loss recall property, Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games, Asymmetric Action Abstractions for Planning in Real-Time Strategy Games

Cites Work

• Efficient computation of equilibria for extensive two-person games
• Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
• Computer solution to the game of pure strategy
• An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information
• Evolutionary Dynamics of Multi-Agent Learning: A Survey
• Amazons Discover Monte-Carlo
• Multiagent Systems
• A Simple Adaptive Procedure Leading to Correlated Equilibrium
• The Nonstochastic Multiarmed Bandit Problem
• Advances in Artificial Intelligence
• Goofspiel — the game of pure strategy
• Deep Blue
• Finite-time analysis of the multiarmed bandit problem
• Unnamed Item
• Unnamed Item
• Unnamed Item