Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs.
Rosemary Emery-MontemerloGeoffrey J. GordonJeff G. SchneiderSebastian ThrunPublished in: AAMAS (2004)
Keyphrases
- approximate solutions
- partially observable stochastic games
- nash equilibrium
- partially observable markov decision processes
- game theory
- np hard
- dynamic programming
- multi agent
- repeated games
- optimal solution
- exact solution
- worst case
- hard optimization problems
- machine learning
- energy function
- special case
- cooperative
- decision making