The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.
Krishnendu ChatterjeeLaurent DoyenSumit NainMoshe Y. VardiPublished in: FoSSaCS (2014)
Keyphrases
- memory requirements
- mixed strategy
- memory usage
- computational complexity
- discrete random variables
- repeated games
- stochastic model
- computer games
- optimal strategy
- game theory
- human computation
- worst case
- neural network
- online auctions
- game theoretic
- computing power
- decision problems
- monte carlo
- learning agents
- solution concepts
- equilibrium strategies