Solving Infinite-Horizon Discounted Markov Games Using a Superharmonic Least-Element Algorithm

DOI10.1287/MNSC.39.1.93MaRDI QIDQ3134566zbMATH OpenOpenAlexFDO

Authors D. J. White

Publication date 15 September 1993

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.39.1.93

zbMATH Keywords

infinite-horizon discounted Markov gamessuperharmonic set

Mathematics Subject Classification ID

Fractional programming (90C32) Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15)

Recommendations

• A Vector Minimum Superharmonic Approach to Solving Infinite-Horizon Discounted Markov Decision Processes
• scientific article; zbMATH DE number 3880480
• A superharmonic approach to solving infinite horizon partially observable Markov decision problems
• Zero-sum infinite-horizon discounted piecewise deterministic Markov games
• On optimal strategy of discounted Markov stochastic games

Cited in

(2)

• A fifth bibliography of fractional programming^*
• A Vector Minimum Superharmonic Approach to Solving Infinite-Horizon Discounted Markov Decision Processes

This page was built for publication: Solving Infinite-Horizon Discounted Markov Games Using a Superharmonic Least-Element Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134566)