Pages that link to "Item:Q2931706"
From MaRDI portal
The following pages link to Markov Decision Problems Where Means Bound Variances (Q2931706):
Displaying 11 items.
- Optimal online selection of a monotone subsequence: a central limit theorem (Q491928) (← links)
- Risk measurement and risk-averse control of partially observable discrete-time Markov systems (Q1616832) (← links)
- A central limit theorem for costs in Bulinskaya's inventory management problem when deliveries face delays (Q1617322) (← links)
- Process-based risk measures and risk-averse control of discrete-time systems (Q2118073) (← links)
- Quickest online selection of an increasing subsequence of specified size (Q2820269) (← links)
- A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming (Q2833111) (← links)
- Online Scheduling with Increasing Subsequence Serving Constraint (Q4632179) (← links)
- Bayesian Exploration for Approximate Dynamic Programming (Q4971589) (← links)
- (Q4998920) (← links)
- Technical Note—Ranking Distributions When Only Means and Variances Are Known (Q5058048) (← links)
- Quantile Markov Decision Processes (Q5095150) (← links)