1 citations · 2 across the 6 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2022
HSVI can solve zero-sum Partially Observable Stochastic Games
Aurélien Delage, Olivier Buffet, Jilles S. Dibangoye +1
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 heur…
cs.AI2020★ 1 cited
On Bellman's Optimality Principle for zs-POSGs
Olivier Buffet, Jilles Dibangoye, Aurélien Delage +2
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 rec…