Dynamic programming for discrete-time finite-horizon optimal switching problems with negative switching costs
From MaRDI portal
Publication:2830883
Abstract: This paper studies a discrete-time optimal switching problem on a finite horizon. The underlying model has a running reward, terminal reward and signed (positive and negative) switching costs. Using the martingale approach to optimal stopping problems, we extend a well known explicit dynamic programming method for computing the value function and the optimal strategy to the case of signed switching costs.
Recommendations
Cited in
(8)- Two-parameter optimal stopping problem with switching costs
- Management strategies for run-of-river hydropower plants: an optimal switching approach
- Optimal switching for alternating processes
- Discrete-time risk-aware optimal switching with non-adapted costs
- Optimal switching between cash-flow streams
- Finite-horizon optimal multiple switching with signed switching costs
- Solving finite time horizon Dynkin games by optimal switching
- A Method for Computing Double Band Policies for Switching between Two Diffusions
This page was built for publication: Dynamic programming for discrete-time finite-horizon optimal switching problems with negative switching costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830883)