2006
DOI: 10.1007/s10479-006-0143-3
|View full text |Cite
|
Sign up to set email alerts
|

A sample-path approach to optimal position liquidation

Abstract: We consider the problem of optimal position liquidation where the expected cash flow stream due to transactions is maximized in the presence of temporary or permanent market impact. A stochastic programming approach is used to construct trading strategies that differentiate decisions with respect to the observed market conditions, and can accommodate various types of trading constraints. As a scenario model, we use a collection of sample paths representing possible future realizations of state variable process… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2006
2006
2011
2011

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 27 publications
0
7
0
Order By: Relevance
“…The stochastic optimization approach is advantageous in our setting because it permits the introduction of risk constraints also in intermediate time periods. This would be practically impossible with dynamic programming approaches [56] where the intermediate nodes represent the maximum cash position when discounting from the terminal time period and hence do not account for the cash-flow impacts of past decisions [57].…”
Section: B Contract Portfolio Optimizationmentioning
confidence: 99%
“…The stochastic optimization approach is advantageous in our setting because it permits the introduction of risk constraints also in intermediate time periods. This would be practically impossible with dynamic programming approaches [56] where the intermediate nodes represent the maximum cash position when discounting from the terminal time period and hence do not account for the cash-flow impacts of past decisions [57].…”
Section: B Contract Portfolio Optimizationmentioning
confidence: 99%
“…Examples include risk constraints, value constraints, and bounds on position changes (see Krokhmal et al [16,17] and Krokhmal and Uryasev [15] for example). The projection procedure would become computationally expensive when such side-constraints are present.…”
Section: Projectionmentioning
confidence: 99%
“…3 It is also possible to go from generating scenarios to bundling them to get trees. An example of this is given in Krokhmal and Uryasev (2003).…”
Section: Trees Of Stochastic Variablesmentioning
confidence: 99%