An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information

DOI10.1613/jair.4477zbMath1315.91009OpenAlexW2105233768MaRDI QIDQ2938479

Michal Pěchouček, Viliam Lisý, Branislav Bošanský, Christopher Kiekintveld

Publication date: 14 January 2015

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

Full work available at URL: https://doi.org/10.1613/jair.4477

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Games in extensive form (91A18)

Related Items (9)

Algorithms for computing strategies in two-player simultaneous move games ⋮ Solving zero-sum one-sided partially observable stochastic games ⋮ Multiple oracle algorithm to solve continuous games ⋮ Exploiting extensive-form structure in empirical game-theoretic analysis ⋮ Approximating maxmin strategies in imperfect recall games using A-loss recall property ⋮ A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs ⋮ Counterfactual regret minimization for integrated cyber and air defense resource allocation ⋮ Faster algorithms for extensive-form game solving via improved smoothing functions ⋮ Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games

This page was built for publication: An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information