Approximations and bounds for a generalized optimal stopping problem
From MaRDI portal
Cites work
- An approximation procedure for stochastic dynamic programming in countable state space
- Approximation procedure for stochastic dynamic programming based on clustering of state and action spaces
- Approximations of Dynamic Programs, I
- Approximations of Dynamic Programs, II
- Approximations of inventory models
- Convergence of discretization procedures in dynamic programming
- Convergence of Dynamic Programming Models
- Dynamic programming and stochastic control
- scientific article; zbMATH DE number 3145638 (Why is no real title available?)
- scientific article; zbMATH DE number 3742447 (Why is no real title available?)
- scientific article; zbMATH DE number 3574704 (Why is no real title available?)
- scientific article; zbMATH DE number 3587854 (Why is no real title available?)
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- scientific article; zbMATH DE number 3613959 (Why is no real title available?)
- scientific article; zbMATH DE number 3637032 (Why is no real title available?)
- scientific article; zbMATH DE number 3639468 (Why is no real title available?)
- scientific article; zbMATH DE number 3320878 (Why is no real title available?)
- Monotone control laws for noisy, countable-state Markov chains
- Optimal Policy in a Dynamic, Single Product, Nonstationary Inventory Model with Several Demand Classes
- Optimal Sequential Procedures when More Than one Stop is Required
- Stochastically monotone Markov Chains
This page was built for publication: Approximations and bounds for a generalized optimal stopping problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953584)