Pages that link to "Item:Q5528345"

The following pages link to On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting (Q5528345):

Displaying 46 items.

• Turnpike theorems for Markov games (Q369470) (← links)
• Policy improvement for perfect information additive reward and additive transition stochastic games with discounted and average payoffs (Q482541) (← links)
• A unified approach to Markov decision problems and performance sensitivity analysis with discounted and average criteria: multichain cases (Q705478) (← links)
• The vanishing discount approach to constrained continuous-time controlled Markov chains (Q709279) (← links)
• Decentralized evolutionary mechanisms for intertemporal economies: A possibility result (Q810356) (← links)
• Strong \(n\)-discount and finite-horizon optimality for continuous-time Markov decision processes (Q890634) (← links)
• A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder) (Q997928) (← links)
• Bias optimality for multichain continuous-time Markov decision processes (Q1038097) (← links)
• The variational calculus and approximation in policy space for Markovian decision processes (Q1068009) (← links)
• On the existence of relative values for undiscounted Markovian decision processes with a scalar gain rate (Q1080370) (← links)
• Strong 1-optimal stationary policies in denumerable Markov decision processes (Q1108940) (← links)
• On optimality criteria for dynamic programs with long finite horizons (Q1142160) (← links)
• Review of a Markov decision algorithm for optimal inspections and revisions in a maintenance system with partial information (Q1203807) (← links)
• An optimality principle for Markovian decision processes (Q1228554) (← links)
• Planning for the long run: programming with patient, Pareto responsive preferences (Q1757582) (← links)
• Singularly perturbed linear programs and Markov decision processes (Q1790182) (← links)
• Index-based policies for discounted multi-armed bandits on parallel machines. (Q1872472) (← links)
• On the existence of relative values for undiscounted multichain Markov decision processes (Q2265959) (← links)
• Bias optimality and strong \(n\) \((n= -1,0)\) discount optimality for Markov decision processes (Q2371871) (← links)
• Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
• Sample-path optimality and variance-maximization for Markov decision processes (Q2460036) (← links)
• Finite state continuous time Markov decision processes with an infinite planning horizon (Q2527603) (← links)
• Linear programming considerations on Markovian decision processes with no discounting (Q2531424) (← links)
• On direct sums of Markovian decision process (Q2536445) (← links)
• On the set of optimal policies in discrete dynamic programming (Q2538774) (← links)
• On a set of optimal policies in continuous time Markovian decision problem (Q2544324) (← links)
• A new optimality criterion for discrete dynamic programming (Q2551744) (← links)
• Finite state multi-armed bandit problems: Sensitive-discount, average-reward and average-overtaking optimality (Q2564701) (← links)
• An axiomatic approach to Markov decision processes (Q2699030) (← links)
• OPTIMALITY OF TRUNK RESERVATION FOR AN M/M/K/N QUEUE WITH SEVERAL CUSTOMER TYPES AND HOLDING COSTS (Q2884253) (← links)
• Generalized Markovian decision processes (Q3208458) (← links)
• A value-iteration scheme for undiscounted multichain Markov renewal programs (Q3221782) (← links)
• A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies (Q3465941) (← links)
• MARKOV DECISION PROCESSES (Q3678995) (← links)
• Optimality equations and sensitive optimality in bounded Markov decision processes¹ (Q3714928) (← links)
• A value iteration method for undiscounted multichain Markov decision processes (Q3789375) (← links)
• (Q3919476) (← links)
• (Q4054294) (← links)
• A new algorithm for a multi-item periodic review inventory system (Q4300607) (← links)
• Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory (Q4304579) (← links)
• Solution procedures for multi-objective markov decision processes (Q4389873) (← links)
• Blackwell optimal policies in a Markov decision process with a Borel state space (Q4834220) (← links)
• Strong 0-discount optimal policies in a Markov decision process with a Borel state space (Q4845096) (← links)
• Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains (Q5244857) (← links)
• (Q5667849) (← links)
• Another Set of Conditions for Strong<i>n</i>(<i>n</i> = −1, 0) Discount Optimality in Markov Decision Processes (Q5697670) (← links)