Angshul Majumdar

Succinct-∃R-Completeness and Information Bounds for Partially Observable Stochastic Games

We establish computational and information bounds for Nash equilibrium in finite, general-sum partially observable stochastic games with an arbitrary number of players and an input-dependent horizon. For rational game data and a unary-encoded horizon, deciding whether an equilibr...