PSPACE-hardness of some combinatorial games.
Aviezri S. FraenkelElisheva GoldschmidtPublished in: J. Comb. Theory, Ser. A (1987)
Keyphrases
- educational games
- video games
- computer games
- game theory
- game play
- computational complexity
- information theoretic
- game theoretic
- game playing
- nash equilibria
- temporal logic
- weighted majority
- coalitional games
- np hard
- phase transition
- nash equilibrium
- learning algorithm
- pspace complete
- complexity bounds
- two player games
- evaluation function
- np complete
- special case
- search algorithm
- multi agent
- reinforcement learning