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.









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)