Discounted Markov games; successive approximation and stopping times

DOI10.1007/BF01770870zbMath0363.90113OpenAlexW2106954941MaRDI QIDQ1240669

K. Appert

Publication date: 1977

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01770870

Mathematics Subject Classification ID

2-person games (91A05) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items

Bilinear programming and structured stochastic games ⋮ Algorithms for stochastic games ? A survey ⋮ A short certificate of the number of universal optimal strategies for stopping simple stochastic games ⋮ On the complexity of computational problems associated with simple stochastic games ⋮ Fictitious play applied to sequences of games and discounted stochastic games ⋮ Value set iteration for two-person zero-sum Markov games ⋮ Discounted Markov games: Generalized policy iteration method

Cites Work

• Unnamed Item
• Unnamed Item
• A modified dynamic programming method for Markovian decision problems
• Discounted semi-Markov decision processes: linear programming and policy iteration
• Bounds and Transformations for Discounted Finite Markov Decision Chains
• Discounted Dynamic Programming
• On Nonterminating Stochastic Games
• Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision Problems
• Algorithms for Stochastic Games with Geometrical Interpretation
• Some Bounds for Discounted Sequential Decision Processes
• Solution of a Markovian decision problem by successive overrelaxation
• Stochastic Games