Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games.
Dan GutfreundRonen ShaltielAmnon Ta-ShmaPublished in: Computational Complexity Conference (2003)
Keyphrases
- video games
- np complete
- information theoretic
- game theory
- nash equilibrium
- weighted majority
- game playing
- computational complexity
- game theoretic
- computer games
- phase transition
- game design
- np hardness
- repeated games
- game tree search
- worst case
- cost benefit
- educational games
- nash equilibria
- game tree
- game play
- database
- genetic algorithm