Conservative Policy Iteration For Zero-Sum POSGs
Occupancy-state reductions make dynamic programming possible for zero-sum partially observable stochastic games (zs-POSGs). Existing point-based solvers usually optimise a central value function. This restores Bellman recursion, but it requires point-based updates over high-dimensional occupancy spaces. We introduce an approximate policy-iteration algorithm for finite-horizon zs-POSGs. The method…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
