.png){kind=icon}
.png){kind=icon}
Return
Time-inconsistent multistage stochastic programs: Martingale bounds
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.02.033.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multistage stochastic programs show time-inconsistency in general, if the objective is neither the expectation nor the maximum functional. This paper considers distortion risk measures (in particular the Average Value-at-Risk) at the final stage of a multistage stochastic program. Such problems are not time consistent. However, it is shown that by considering risk parameters at random level and by extending the state space appropriately, the value function corresponding to the optimal decisions evolves as a martingale and a dynamic programming principle is applicable. In this setup the risk profile has to be accepted to vary over time and to be adapted dynamically. Further, a verification theorem is provided, which characterizes optimal decisions by sub- and supermartingales. These enveloping martingales constitute a lower and an upper bound of the optimal value function. The basis of the analysis is a new decomposition theorem for the Average Value-at-Risk, which is given in a time consistent formulation. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Keywords:
Stochastic optimization
Risk measure
Average Value-at-Risk
Dynamic programming
Time consistency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W