The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games.
Krishnendu ChatterjeeRasmus Ibsen-JensenPublished in: SODA (2015)
Keyphrases
- mixed strategy
- repeated games
- game theory
- nash equilibrium
- incomplete information
- nash equilibria
- normal form games
- solution concepts
- payoff functions
- finite number
- stochastic games
- memory usage
- game theoretic
- video games
- game playing
- learning agents
- dynamically created
- neural network
- computing power
- memory space
- memory requirements
- data access
- mutual exclusion
- computer games
- cooperative