The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games.
Krishnendu ChatterjeeRasmus Ibsen-JensenPublished in: CoRR (2014)
Keyphrases
- mixed strategy
- repeated games
- nash equilibrium
- game theory
- incomplete information
- equilibrium strategies
- memory requirements
- solution concepts
- computing power
- payoff functions
- cooperative
- finite number
- stochastic games
- memory space
- two player games
- human computation
- learning environment
- long term
- game theoretic
- game play
- game playing
- pure nash equilibria
- dynamically created
- video games
- evolutionary game theory
- mutual exclusion
- multi agent
- learning games
- learning agents
- optimal strategy
- memory usage
- imperfect information
- nash equilibria