A Nonparametric Algorithm for Optimal Stopping Based on Robust Optimization

Published Online:https://doi.org/10.1287/opre.2023.2461

References

  • Andersen L (1999) A simple approach to the pricing of Bermudan swaptions in the multi-factor LIBOR market model. J. Comput. Finance 3(2):5–32.CrossrefGoogle Scholar
  • Andersen L, Broadie M (2004) Primal-dual simulation algorithm for pricing multidimensional American options. Management Sci. 50(9):1222–1234.LinkGoogle Scholar
  • Bally V, Pages G (2003) A quantization algorithm for solving multidimensional discrete-time optimal stopping problems. Bernoulli. 9(6):1003–1049.CrossrefGoogle Scholar
  • Bayer C, Häppölä J, Tempone R (2019) Implied stopping rules for American basket options from Markovian projection. Quant. Finance 19(3):371–390.CrossrefGoogle Scholar
  • Bayer C, Tempone R, Wolfers S (2020) Pricing American options by exercise rate optimization. Quant. Finance. 20(11):1–12.Google Scholar
  • Bayraktar E, Yao S (2014) On the robust optimal stopping problem. SIAM J. Control Optim. 52(5):3135–3175.CrossrefGoogle Scholar
  • Becker S, Cheridito P, Jentzen A (2019) Deep optimal stopping. J. Mach. Learn. Res. 20:74.Google Scholar
  • Belomestny D (2011a) On the rates of convergence of simulation-based optimization algorithms for optimal stopping problems. Ann. Appl. Probab. 21(1):215–239.CrossrefGoogle Scholar
  • Belomestny D (2011b) Pricing Bermudan options by nonparametric regression: Optimal rates of convergence for lower estimates. Finance Stochastics 15(4):655–683.CrossrefGoogle Scholar
  • Belomestny D (2013) Solving optimal stopping problems via empirical dual optimization. Ann. Appl. Probab. 23(5):1988–2019.CrossrefGoogle Scholar
  • Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization, vol. 28 (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • Bertsimas D, Shtern S, Sturt B (2023) A data-driven approach to multistage stochastic linear optimization. Management Sci. 69(1):51–74.LinkGoogle Scholar
  • Bezerra SC, Ohashi A, Russo F, de Souza F (2020) Discrete-type approximations for non-Markovian optimal stopping problems: Part ii. Methodol. Comput. Appl. Probab. 22(3):1–35.Google Scholar
  • Broadie M, Detemple J (1997) The valuation of American options on multiple assets. Math. Finance 7(3):241–286.CrossrefGoogle Scholar
  • Broadie M, Glasserman P (1997) Pricing American-style securities using simulation. J. Econom. Dynam. Control 21(8–9):1323–1352.CrossrefGoogle Scholar
  • Brown DB, Smith JE, Sun P (2010) Information relaxations and duality in stochastic dynamic programs. Oper. Res. 58(4 pt 1):785–801.LinkGoogle Scholar
  • Bruss FT (2005) What is known about Robbins’ problem? J. Appl. Probab. 42(1):108–120.CrossrefGoogle Scholar
  • Carriere JF (1996) Valuation of the early-exercise price for options using simulations and nonparametric regression. Insurance Math. Econom. 19(1):19–30.CrossrefGoogle Scholar
  • Ciocan DF, Mišić VV (2020) Interpretable optimal stopping. Management Sci. 68(3):1616–1638.LinkGoogle Scholar
  • Clément E, Lamberton D, Protter P (2002) An analysis of a least squares regression method for American option pricing. Finance Stochastics 6(4):449–471.CrossrefGoogle Scholar
  • Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, vol. 271 (Springer, Cham, Switzerland).CrossrefGoogle Scholar
  • David I, Yechiali U (1985) A time-dependent stopping problem with application to live organ transplants. Oper. Res. 33(3):491–504.LinkGoogle Scholar
  • Delage E, Iancu DA (2015) Robust Multistage Decision Making. The Operations Research Revolution (INFORMS, Catonsville, MD) 20–46.LinkGoogle Scholar
  • Desai VV, Farias VF, Moallemi CC (2012) Pathwise optimization for optimal stopping problems. Management Sci. 58(12):2292–2308.LinkGoogle Scholar
  • Egloff D (2005) Monte Carlo algorithms for optimal stopping and statistical learning. Ann. Appl. Probab. 15(2):1396–1432.CrossrefGoogle Scholar
  • Fathan A, Delage E (2021) Deep reinforcement learning for optimal stopping with application in financial engineering. Preprint, submitted May 19, https://arxiv.org/abs/2105.08877.Google Scholar
  • Feng Y, Gallego G (1995) Optimal starting times for end-of-season sales and optimal stopping times for promotional fares. Management Sci. 41(8):1371–1391.LinkGoogle Scholar
  • Garcıa D (2003) Convergence and biases of Monte Carlo estimates of American option prices using a parametric exercise rule. J. Econom. Dynam. Control 27(10):1855–1879.CrossrefGoogle Scholar
  • Gatheral J, Jaisson T, Rosenbaum M (2018) Volatility is rough. Quant. Finance 18(6):933–949.CrossrefGoogle Scholar
  • Gemmrich S (2012) Multilevel Monte Carlo methods for American options. Master’s thesis, University of Oxford.Google Scholar
  • Glasserman P (2013) Monte Carlo Methods in Financial Engineering, vol. 53 (Springer Science & Business Media, New York).Google Scholar
  • Glasserman P, Yu B (2004) Number of paths vs. number of basis functions in American option pricing. Ann. Appl. Probab. 14(4):2090–2119.CrossrefGoogle Scholar
  • Goldberg DA, Chen Y (2018) Beating the curse of dimensionality in options pricing and optimal stopping. Preprint, submitted July 6, https://arxiv.org/abs/1807.02227.Google Scholar
  • Goudenège L, Molent A, Zanette A (2020) Machine learning for pricing American options in high-dimensional Markovian and non-Markovian models. Quant. Finance 20(4):573–591.CrossrefGoogle Scholar
  • Haugh MB, Kogan L (2004) Pricing American options: A duality approach. Oper. Res. 52(2):258–270.LinkGoogle Scholar
  • Hochbaum DS (2004) 50th anniversary article: Selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today. Management Sci. 50(6):709–723.LinkGoogle Scholar
  • Iancu DA, Trichakis N, Yoon DY (2021) Monitoring with limited information. Management Sci. 67(7):4233–4251.LinkGoogle Scholar
  • Kohli R, Krishnamurti R, Mirchandani P (1994) The minimum satisfiability problem. SIAM J. Discrete Math. 7(2):275–283.CrossrefGoogle Scholar
  • Kunitomo N, Ikeda M (1992) Pricing options with curved boundaries. Math. Finance 2(4):275–298.CrossrefGoogle Scholar
  • Leão D, Ohashi A, Russo F (2019) Discrete-type approximations for non-Markovian optimal stopping problems: Part I. J. Appl. Probab. 56(4):981–1005.CrossrefGoogle Scholar
  • Longstaff FA, Schwartz ES (2001) Valuing American options by simulation: A simple least-squares approach. Rev. Financial Stud. 14(1):113–147.CrossrefGoogle Scholar
  • Orlin JB (2013) Max flows in o(nm) time, or better. Proc. Forty-Fifth Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 765–774.Google Scholar
  • Picard JC (1976) Maximal closure of a graph and applications to combinatorial problems. Management Sci. 22(11):1268–1272.LinkGoogle Scholar
  • Reuters (2021) U.S. equity options set new volume record. Accessed March 1, 2021, https://www.reuters.com/article/us-usa-stocks-options-idUSKBN29K2OI.Google Scholar
  • Rhys JM (1970) A selection problem of shared fixed costs and network flows. Management Sci. 17(3):200–207.LinkGoogle Scholar
  • Riedel F (2009) Optimal stopping with multiple priors. Econometrica 77(3):857–908.CrossrefGoogle Scholar
  • Rogers LC (2002) Monte Carlo valuation of American options. Math. Finance 12(3):271–286.CrossrefGoogle Scholar
  • Tsitsiklis JN, Van Roy B (2001) Regression methods for pricing complex American-style options. IEEE Trans. Neural Netw. 12(4):694–703.CrossrefGoogle Scholar
  • Zanger DZ (2020) General error estimates for the Longstaff–Schwartz least-squares Monte Carlo algorithm. Math. Oper. Res. 45(3):923–946.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.