Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy.
Søren Kristoffer Stiil FrederiksenPeter Bro MiltersenPublished in: ISAAC (2013)
Keyphrases
- game theory
- computer games
- video games
- special case
- computational complexity
- game playing
- game play
- virtual world
- hierarchical structure
- game design
- pure nash equilibria
- pursuit evasion
- monte carlo tree search
- mutual exclusion
- coalitional games
- transitive closure
- nash equilibrium
- approximation algorithms
- worst case
- educational games
- game based learning
- imperfect information
- supply chain
- two player games
- np hard
- learning algorithm