Algorithms for discounted stochastic games

DOI10.1007/BF00935562zbMath0245.93024OpenAlexW2034413058MaRDI QIDQ2555468

Yanyan Li

Publication date: 1973

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Differential games (aspects of game theory) (91A23) Probabilistic games; gambling (91A60)

Related Items (12)

A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations ⋮ A short certificate of the number of universal optimal strategies for stopping simple stochastic games ⋮ Strategy improvement for concurrent reachability and turn-based stochastic safety games ⋮ On the complexity of computational problems associated with simple stochastic games ⋮ Towards solving 2-TBSG efficiently ⋮ Value set iteration for two-person zero-sum Markov games ⋮ The complexity of solving reachability games using value and strategy iteration ⋮ Stochastic game models of brand switching ⋮ Unnamed Item ⋮ New Algorithms for Solving Zero-Sum Stochastic Games ⋮ A formula for the value of a stochastic game ⋮ Multi-agent reinforcement learning: a selective overview of theories and algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• On stochastic games
• Equilibrium Points of Bimatrix Games
• Discrete Dynamic Programming
• On Nonterminating Stochastic Games
• Algorithms for Stochastic Games with Geometrical Interpretation
• Noncooperative Stochastic Games
• Stochastic Games

This page was built for publication: Algorithms for discounted stochastic games