2018
DOI: 10.1080/14697688.2018.1524155
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic portfolio optimization with liquidity cost and market impact: a simulation-and-regression approach

Abstract: We present a simulation-and-regression method for solving dynamic portfolio allocation problems in the presence of general transaction costs, liquidity costs and market impacts. This method extends the classical least squares Monte Carlo algorithm to incorporate switching costs, corresponding to transaction costs and transient liquidity costs, as well as multiple endogenous state variables, namely the portfolio value and the asset prices subject to permanent market impacts. To do so, we improve the accuracy of… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 24 publications
(20 citation statements)
references
References 43 publications
0
20
0
Order By: Relevance
“…Multi-period investment problems taking into account the stochastic nature of financial markets are usually solved in practice by scenario approximations of stochastic programming models, which are computationally challenging (see, e.g., Dantzig and Infanger, 1993, Mulvey and Shetty, 2004, Gülpınar and Rustem, 2007, Pınar, 2007. Recent literature has explored simulation-and-regression approaches to approximate the optimal policy through a large number of repetitions using reinforcement learning (Denault, Delage, and Simonato, 2017, Zhang et al, 2018, Kolm and Ritter, 2019. Both approaches require a good simulator.…”
Section: Introductionmentioning
confidence: 99%
“…Multi-period investment problems taking into account the stochastic nature of financial markets are usually solved in practice by scenario approximations of stochastic programming models, which are computationally challenging (see, e.g., Dantzig and Infanger, 1993, Mulvey and Shetty, 2004, Gülpınar and Rustem, 2007, Pınar, 2007. Recent literature has explored simulation-and-regression approaches to approximate the optimal policy through a large number of repetitions using reinforcement learning (Denault, Delage, and Simonato, 2017, Zhang et al, 2018, Kolm and Ritter, 2019. Both approaches require a good simulator.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, alternative randomization schemes have been proposed in the literature, such as Ludkovski and Maheshwari (2019), Balata and Palczewski (2018), Bachouch et al (2018) or Shen and Weng (2019), which are more amenable to comprehensive convergence proofs, see Balata and Palczewski (2017) and Huré et al (2018). Nevertheless, the classical control randomization scheme retains some unique advantages, such as the ease with which it can handle switching costs, as shown in Zhang et al (2019).…”
Section: Control Randomizationmentioning
confidence: 99%
“…Some difficulties with the Monte Carlo approach are the choice of the basis and the number of Monte Carlo paths needed for a stable convergence. Still, the Monte Carlo would be the method of choice for more realistic portfolio allocation with multiple risky assets (see Zhang et al (2019)), as the PDE approach could easily become computationally intractable in this situation.…”
Section: Power Utility Functionmentioning
confidence: 99%
“…We apply the two-stage LSMC method and the classical LSMC method to CRRA utility optimization, and then compare the resulting initial value function estimatesv 0 = 1 M M m=1 (Ŵ t N ) 1−γ /(1−γ) for a one-year time horizon with monthly rebalancing. Following Zhang et al (2018), we choose M = 10, 000 sample paths to ensure numerical stability of the solution. For the classical LSMC method, we include the utility function itself as part of the regression basis, so that the regression basis can be adjusted to some extent to the risk-aversion parameter.…”
Section: Model Validationmentioning
confidence: 99%
“…Brandt, Goyal, Santa-Clara, and Stroud (2005) The aforementioned works solve problems with a continuous payoff function for which the classical LSMC method can be very effective. By contrast, highly nonlinear, abruptly changing or discontinuous payoffs can be more difficult to handle for the LSMC algorithm (Zhang et al (2018), Balata and Palczewski (2018), Andreasson and Shevchenko (2018)). The STRS (2.2), with its abrupt drop at the upper bound U W , is such a difficult function.…”
Section: Multi-period Portfolio Optimizationmentioning
confidence: 99%