no code implementations • 5 Feb 2024 • Johan Peralez, Aurélien Delage, Olivier Buffet, Jilles S. Dibangoye
A recent theory shows that a multi-player decentralized partially observable Markov decision process can be transformed into an equivalent single-player game, enabling the application of \citeauthor{bellman}'s principle of optimality to solve the single-player game by breaking it down into single-stage subgames.
no code implementations • 26 Oct 2022 • Aurélien Delage, Olivier Buffet, Jilles S. Dibangoye, Abdallah Saffidine
State-of-the-art methods for solving 2-player zero-sum imperfect information games rely on linear programming or regret minimization, though not on dynamic programming (DP) or heuristic search (HS), while the latter are often at the core of state-of-the-art solvers for other sequential decision-making problems.
no code implementations • 25 Oct 2021 • Aurélien Delage, Olivier Buffet, Jilles Dibangoye
Dynamic programming and heuristic search are at the core of state-of-the-art solvers for sequential decision-making problems.
no code implementations • 29 Jun 2020 • Olivier Buffet, Jilles Dibangoye, Aurélien Delage, Abdallah Saffidine, Vincent Thomas
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.