The Complexity of Computing Robust Mediated Equilibria in Ordinal Games.
Vincent ConitzerPublished in: AAAI (2024)
Keyphrases
- nash equilibria
- game theoretic
- game theory
- nash equilibrium
- pure strategy
- decision problems
- pure nash equilibria
- computer games
- computational cost
- video games
- space complexity
- extensive form games
- pure nash equilibrium
- fictitious play
- partial occlusion
- robust estimation
- incomplete information
- long run
- fixed point
- repeated games
- utility function
- computationally efficient
- virtual environment
- particle filter
- computational complexity