Policy improvement for perfect information additive reward and additive transition stochastic games with discounted and average payoffs

DOI10.3934/jdg.2014.1.347zbMath1329.91013OpenAlexW2154345300MaRDI QIDQ482541

Matthew Bourque, Thirukkannamangai E. S. Raghavan

Publication date: 5 January 2015

Published in: Journal of Dynamics and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jdg.2014.1.347

zbMATH Keywords

Markov decision processstochastic gamespolicy iterationperfect informationadditive reward additive transition

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40)

Related Items (1)

Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information
• On stochastic games with additive reward and transition structure
• Sensitivity analysis in discounted Markovian decision problems
• An orderfield property for stochastic games when one player controls transition probabilities
• A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
• A policy iteration algorithm for zero-sum stochastic games with mean payoff
• Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations
• Stochastic games have a value
• Asymptotic Linear Programming
• Discrete Dynamic Programming
• On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
• Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix
• Stochastic Games

This page was built for publication: Policy improvement for perfect information additive reward and additive transition stochastic games with discounted and average payoffs