Optimal decision procedures for finite Markov chains. Part II: Communicating systems

DOI10.2307/1425832MaRDI QIDQ4401247zbMATH OpenOpenAlexFDO

Authors John Bather

Publication date 1973

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1425832

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Decision theory (91B06) Game theory (91A99) Decision theory for games (91A35) Optimal stochastic control (93E20)

Cited in

(26)

• Controlled Markov set-chains under average criteria
• A zero-sum stochastic game with compact action sets and no asymptotic value
• Communicating MDPs: Equivalence and LP properties
• A new algorithm for a multi-item periodic review inventory system
• Asymptotic behavior of continuous stochastic games
• Solving Markovian decision processes by successive elimination of variables
• Piecewise linear concave dynamical systems appearing in the microscopic traffic modeling
• Policy iteration type algorithms for recurrent state Markov decision processes
• SEMI-MARKOV DECISION PROCESSES
• A Brouwer fixed-point mapping approach to communicating Markov decision processes
• Estimation of finite probabilities via aggregation of Markov chains
• The set of limiting distributions for a Markov chain with fuzzy transition probabilities
• A structured pattern matrix algorithm for multichain Markov decision processes
• Connectedness conditions used in finite state Markov decision processes
• Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information
• On the functional equations in undiscounted and sensitive discounted stochastic games
• The method of value oriented successive approximations for the average reward Markov decision process
• An accretive operator approach to ergodic zero-sum stochastic games
• Estimation and control in multichain processes
• Stationary anonymous sequential games with undiscounted rewards
• A Fixed Point Approach to Undiscounted Markov Renewal Programs
• On the existence of relative values for undiscounted Markovian decision processes with a scalar gain rate
• On structural properties of optimal average cost functions in Markov decision processes with Borel spaces and universally measurable policies
• An improved algorithm for solving communicating average reward Markov decision processes
• The Perron-Frobenius theorem for homogeneous, monotone functions
• Contraction mappings underlying undiscounted Markov decision problems

This page was built for publication: Optimal decision procedures for finite Markov chains. Part II: Communicating systems

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