An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games.
Carlo CominRomeo RizziPublished in: CoRR (2015)
Keyphrases
- optimal strategy
- upper bound
- game theory
- cooperative game
- nash equilibrium
- lower bound
- game tree
- worst case
- decision problems
- repeated games
- mixed strategy
- game theoretic
- payoff functions
- monte carlo
- expected cost
- nash equilibria
- long term
- branch and bound algorithm
- branch and bound
- competitive ratio
- error probability
- expected utility
- lower and upper bounds
- artificial intelligence
- serious games
- mathematical models
- video games
- solution concepts
- computational complexity
- online game
- incomplete information
- computer games
- stochastic games
- experimental data
- learning agents
- computational model
- constant factor
- search space
- search algorithm
- machine learning