Optimal decision procedures for finite Markov chains. Part III: General convex systems
From MaRDI portal
Publication:4401248
DOI10.2307/1425833zbMath0275.90050OpenAlexW4246592151MaRDI QIDQ4401248
Publication date: 1973
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1425833
Decision theory (91B06) Game theory (91A99) Optimal stochastic control (93E20) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Decision theory for games (91A35)
Related Items
Two-person zero-sum stochastic games, A zero-sum stochastic game with compact action sets and no asymptotic value, Exact decomposition approaches for Markov decision processes: a survey, Denumerable state semi-Markov decision processes with unbounded costs, average cost criterion, A value iteration method for undiscounted multichain Markov decision processes, A note on two-person zero-sum communicating stochastic games, On polynomial cases of the unichain classification problem for Markov decision processes, A Fixed Point Approach to Undiscounted Markov Renewal Programs, Communicating zero-sum product stochastic games, Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains, Finite state Markov decision models with average reward criteria
