scientific article; zbMATH DE number 3208653

From MaRDI portal
Publication:5335719

zbMath0128.12804MaRDI QIDQ5335719

Ronald A. Howard

Publication date: 1964


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (24)

On the existence of relative values for undiscounted Markovian decision processes with a scalar gain rateOn undiscounted semi-Markov decision processes with absorbing statesBlock-scaling of value-iteration for discounted Markov renewal programmingReplacement process decomposition for discounted Markov renewal programmingSolving Markovian decision processes by successive elimination of variablesExistence of a solution to the Markov renewal programming problemA Brouwer fixed-point mapping approach to communicating Markov decision processesGeneralized Markovian decision processesApplication of Markov renewal theory and <scp>semi‐Markov</scp> decision processes in maintenance modeling and optimization of multi‐unit systemsDenumerable semi-Markov decision chains with small interest ratesA Policy Improvement Algorithm for Solving a Mixture Class of Perfect Information and AR-AT Semi-Markov GamesSemi-Markov decision processes with limiting ratio average rewardsOn the existence of relative values for undiscounted multichain Markov decision processesBounds on the fixed point of a monotone contraction operatorSolutions of semi-Markov control models with recursive discount rates and approximation by $\epsilon-$optimal policiesOptimal stochastic controlOn the optimal long run control of Markov renewal processesScalar timing and semi-Markov chains in free-operant avoidanceControlled semi-Markov models under long-run average rewardsOptimal control of stationary Markov processesSemi-Markov decision processes with vector pay-offsComputation of optimal policies in discounted semi-Markov decision chainsGeneralized polynomial approximations in Markovian decision processesThe variational calculus and approximation in policy space for Markovian decision processes




This page was built for publication: