Algorithms for computing strategies in two-player simultaneous move games

DOI10.1016/J.ARTINT.2016.03.005MaRDI QIDQ286381zbMATH OpenOpenAlexWikidataFDO

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

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 equilibriumalpha-beta pruningbackward inductioncounterfactual regret minimizationdouble-oracle algorithmgame playingMarkov gamesMonte Carlo tree searchregret matchingsimultaneous move games

Mathematics Subject Classification ID

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

Recommendations

• On the equilibria of alternating move games
• scientific article; zbMATH DE number 42543
• Computing human-understandable strategies: deducing fundamental rules of poker strategy
• Fast algorithms for finding randomized strategies in game trees
• Algorithms for stochastic games ? A survey

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• A Simple Adaptive Procedure Leading to Correlated Equilibrium
• Advances in Artificial Intelligence
• Amazons Discover Monte-Carlo
• An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
• Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
• Computer solution to the game of pure strategy
• Computing approximate Nash equilibria and robust best-responses using sampling
• Deep Blue
• Efficient computation of equilibria for extensive two-person games
• Evolutionary dynamics of multi-agent learning: a survey
• Finite-time analysis of the multiarmed bandit problem
• Game theory evolving. A problem-centered introduction to modeling strategic interaction
• Goofspiel — the game of pure strategy
• Multiagent Systems
• The Nonstochastic Multiarmed Bandit Problem

Cited in

(5)

• Approximating maxmin strategies in imperfect recall games using A-loss recall property
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• Asymmetric Action Abstractions for Planning in Real-Time Strategy Games
• Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
• Computer solution to the game of pure strategy

This page was built for publication: Algorithms for computing strategies in two-player simultaneous move games

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