Pages that link to "Item:Q5554057"
From MaRDI portal
The following pages link to An Optimality Condition for Discrete Dynamic Programming with no Discounting (Q5554057):
Displaying 15 items.
- On optimality criteria for dynamic programs with long finite horizons (Q1142160) (← links)
- Denumerable semi-Markov decision chains with small interest rates (Q1174702) (← links)
- An optimality principle for Markovian decision processes (Q1228554) (← links)
- Planning for the long run: programming with patient, Pareto responsive preferences (Q1757582) (← links)
- Index-based policies for discounted multi-armed bandits on parallel machines. (Q1872472) (← 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)
- Adaptive Policies in Markov Decision Processes with Uncertain Transition Matrices (Q3664853) (← links)
- (Q4054294) (← links)
- Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory (Q4304579) (← links)
- Blackwell optimal policies in a Markov decision process with a Borel state space (Q4834220) (← links)
- Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains (Q5244857) (← links)
- (Q5667849) (← links)
