Login / Signup

A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions.

Endre BorosKhaled M. ElbassioniVladimir GurvichKazuhisa Makino
Published in: Inf. Comput. (2019)
Keyphrases
  • dynamic programming
  • learning algorithm
  • simulated annealing
  • computational complexity
  • perfect information
  • objective function
  • monte carlo
  • worst case
  • game theory
  • learning automata
  • imperfect information