Uniform hardness versus randomness tradeoffs for Arthur-Merlin games.
Dan GutfreundRonen ShaltielAmnon Ta-ShmaPublished in: Comput. Complex. (2003)
Keyphrases
- game theory
- computer games
- video games
- phase transition
- computational complexity
- nash equilibria
- search algorithm
- learning agents
- information theoretic
- game playing
- design decisions
- case study
- linear array
- agnostic learning
- game theoretic
- game design
- nash equilibrium
- learning theory
- worst case
- game play
- game based learning
- stochastic games
- np hardness
- state space
- game tree search
- reinforcement learning
- general game playing
- weighted majority
- data sets
- cost benefit
- leader follower