Fetching the paper…
Reading the bibliography…
Many non-trivial sequential decision-making problems are efficiently solved by relying on Bellman's optimality principle, i.e., exploiting the fact that sub-problems are nested recursively within the original problem.
Simplified two-person Poker
H. W. Kuhn · 1950
Earlier work this paper cites.
On the theory of dynamic programming
R. Bellman · 1952
Earlier work this paper cites.
Extensive games and the problem of information
H. W. Kuhn · 1953
Earlier work this paper cites.
Stochastic games
L. S. Shapley · 1953
Earlier work this paper cites.
Optimal control of Markov processes with incomplete state information
K. Åström · 1965
Earlier work this paper cites.
Game Theory
D. Fudenberg and J. Tirole · 1991
Earlier work this paper cites.
Multiobjective A*
B. S. Stewart and C. C. White, III · 1991
Earlier work this paper cites.
The complexity of two-person zero-sum games in extensive form
D. Koller and N. Megiddo · 1992
Earlier work this paper cites.
Efficient computation of equilibria for extensive two-person games
D. Koller, N. Megiddo, and B. von Stengel · 1996
Earlier work this paper cites.
Efficient computation of behavior strategies
B. von Stengel · 1996
Earlier work this paper cites.
On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems
O. Madani, S. Hanks, and A. Condon · 1999
Earlier work this paper cites.
Dynamic games with hidden actions and hidden states
H. L. Cole and N. Kocherlakota · 2001
Earlier work this paper cites.
The complexity of decentralized control of Markov decision processes
D. Bernstein, R. Givan, N. Immerman, and S. Zilberstein · 2002
Cited alongside, same era.
Zero-sum stochastic games with partial information
M. K. Ghosh, D. R. McDonald, and S. Sinha · 2004
Cited alongside, same era.
Dynamic programming for partially observable stochastic games
E. A. Hansen, D. Bernstein, and S. Zilberstein · 2004
Cited alongside, same era.
MAA*: A heuristic search algorithm for solving decentralized POMDPs
D. Szer, F. Charpillet, and S. Zilberstein · 2005
Cited alongside, same era.
Dec-POMDPs and extensive form games: equivalence of models and algorithms
F. Oliehoek and N. Vlassis · 2006
Cited alongside, same era.
Probabilistic Planning for Robotic Exploration
T. Smith · 2007
Cited alongside, same era.
Finite- and infinite-horizon Shapley games with nonsymmetric partial observation
A. Basu and L. Stettner · 2015
Later among the works it cites.
A security game combining patrolling and alarm–triggered responses under spatial and detection uncertainties
N. Basilico, G. De Nittis, and N. Gatti · 2016
Later among the works it cites.
Optimally solving Dec-POMDPs as continuous-state MDPs
J. Dibangoye, C. Amato, O. Buffet, and F. Charpillet · 2016
Later among the works it cites.
Structure in the value function of two-player zero-sum games of incomplete information
A. Wiggers, F. Oliehoek, and D. Roijers · 2016
Later among the works it cites.
Heuristic search value iteration for one-sided partially observable stochastic games
K. Horák, B. Bošanský, and M. Pěchouček · 2017
Later among the works it cites.
Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Regret minimization in games with incomplete information
M. Zinkevich, M. Johanson, M. Bowling, and C. Piccione · 2007
Cited alongside, same era.
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Y. Shoham and K. Leyton-Brown · 2009
Cited alongside, same era.
An analysis of multiobjective search algorithms and heuristics
E. Machuca · 2011
Cited alongside, same era.
Point based value iteration with optimal belief compression for Dec-POMDPs
L. C. MacDermed and C. Isbell · 2013
Cited alongside, same era.
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee and L. Doyen · 2014
Cited alongside, same era.
From bandits to Monte-Carlo Tree Search: The optimistic principle applied to optimization and planning
R. Munos · 2014
Cited alongside, same era.
N. Brown and T. Sandholm · 2018
Later among the works it cites.
ρ \rho -POMDPs have Lipschitz-continuous ϵ \epsilon -optimal value functions
M. Fehr, O. Buffet, V. Thomas, and J. Dibangoye · 2018
Later among the works it cites.
Solving partially observable stochastic games with public observations
K. Horák and B. Bošanský · 2019
Later among the works it cites.
Heuristic search value iteration for zero-sum stochastic games
O. Buffet, J. Dibangoye, A. Saffidine, and V. Thomas · 2020
Closest in time.
HSVI for zs-POSGs using concavity, convexity and Lipschitz properties
A. Delage, O. Buffet, and J. Dibangoye · 2021
Closest in time.
HSVI can solve zero-sum partially observable stochastic games
A. Delage, O. Buffet, J. S. Dibangoye, and A. Saffidine · 2022
Closest in time.