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