Fetching the paper…
Reading the bibliography…
The problem of high-dimensional path-dependent optimal stopping (OS) is important to multiple academic communities and applications.
Gordon RD (1941) Values of mills’ ratio of area to bounding ordinate and of the normal probability integral for large values of the argument. The Annals of Mathematical Statistics 12(3):364–366
1941
Earlier work this paper cites.
Chow Y, Robbins H, Siegmund D (1971) Great Expectations: The Theory of Optimal Stopping (Houghton Mifflin, Boston)
1971
Earlier work this paper cites.
Freeman P (1983) The secretary problem and its extensions: A review. International Statistical Review/Revue Internationale de Statistique 189–206
1983
Earlier work this paper cites.
Hill TP, Kertz RP (1983) Stop rule inequalities for uniformly bounded sequences of random variables. Transactions of the American Mathematical Society 278(1):197–207
1983
Earlier work this paper cites.
Nemirovski AS, Yudin DB (1983) Problem complexity and method efficiency in optimization
1983
Earlier work this paper cites.
Boukai B (1990) An explicit expression for the distribution of the supremum of brownian motion with a change point. Communications in Statistics-Theory and Methods 19(1):31–40
1990
Earlier work this paper cites.
Rockafellar RT, Wets RJB (1991) Scenarios and policy aggregation in optimization under uncertainty. Mathematics of operations research 16(1):119–147
1991
Earlier work this paper cites.
Hill TP, Kertz RP (1992) A survey of prophet inequalities in optimal stopping theory. Contemp. Math 125:191–207
1992
Earlier work this paper cites.
Davis MH, Karatzas I (1994) A deterministic approach to optimal stopping. Probability, Statistics and Optimisation (ed. FP Kelly). NewYork Chichester: John Wiley & Sons Ltd 455–466
1994
Earlier work this paper cites.
Arora S (1996) Polynomial time approximation schemes for euclidean tsp and other geometric problems. Proceedings of 37th Conference on Foundations of Computer Science , 2–11 (IEEE)
1996
Earlier work this paper cites.
Arora S (1997) Nearly linear time approximation schemes for euclidean tsp and other geometric problems. Proceedings 38th Annual Symposium on Foundations of Computer Science , 554–563 (IEEE)
1997
Earlier work this paper cites.
Traub JF, Werschulz AG (1998) Complexity and information , volume 26862 (Cambridge University Press)
1998
Earlier work this paper cites.
Andersen LB (1999) A simple approach to the pricing of bermudan swaptions in the multi-factor libor market model. Available at SSRN 155208
1999
Earlier work this paper cites.
Chalasani P, Jha S, Saias I (1999) Approximate option pricing. Algorithmica 25:2–21
1999
Earlier work this paper cites.
Aingworth D, Motwani R, Oldham JD (2000) Accurate approximations for asian options. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms , 891–900
2000
Earlier work this paper cites.
Longstaff FA, Schwartz ES (2001) Valuing american options by simulation: a simple least-squares approach. The review of financial studies 14(1):113–147
2001
Earlier work this paper cites.
Tsitsiklis JN, Van Roy B (2001) Regression methods for pricing complex american-style options. IEEE Transactions on Neural Networks 12(4):694–703
2001
Earlier work this paper cites.
Clément E, Lamberton D, Protter P (2002) An analysis of a least squares regression method for american option pricing. Finance and Stochastics 6(4):449–471
2002
Earlier work this paper cites.
Rogers LC (2002) Monte carlo valuation of american options. Mathematical Finance 12(3):271–286
2002
Earlier work this paper cites.
Glasserman P, Merener N (2003) Cap and swaption approximations in libor market models with jumps. Journal of Computational Finance 7(1):1–36
2003
Earlier work this paper cites.
Kakade SM, et al. (2003) On the sample complexity of reinforcement learning . Ph.D. thesis, University of London London, England
2003
Earlier work this paper cites.
Andersen L, Broadie M (2004) Primal-dual simulation algorithm for pricing multidimensional american options. Management Science 50(9):1222–1234
2004
Earlier work this paper cites.
Beier R, Vöcking B (2004) Random knapsack in expected polynomial time. Journal of Computer and System Sciences 69(3):306–329
2004
Earlier work this paper cites.
Haugh MB, Kogan L (2004) Pricing american options: a duality approach. Operations Research 52(2):258–270
2004
Earlier work this paper cites.
Kolodko A, Schoenmakers J (2004) An efficient dual monte carlo upper bound for bermudan style derivative
2004
Earlier work this paper cites.
Kou SG, Wang H (2004) Option pricing under a double exponential jump diffusion model. Management science 50(9):1178–1192
2004
Earlier work this paper cites.
Lai TL, Wong SS (2004) Valuation of american options via basis functions. IEEE transactions on automatic control 49(3):374–385
2004
Earlier work this paper cites.
Spielman DA, Teng SH (2004) Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM (JACM) 51(3):385–463
2004
Earlier work this paper cites.
Stentoft L (2004) Convergence of the least squares monte carlo approach to american option valuation. Management Science 50(9):1193–1203
2004
Earlier work this paper cites.
Egloff D, et al. (2005) Monte carlo algorithms for optimal stopping and statistical learning. The Annals of Applied Probability 15(2):1396–1432
2005
Earlier work this paper cites.
Hamida SB, Cont R (2005) Recovering volatility from option prices by evolutionary optimization. The Journal of Computational Finance
2005
Earlier work this paper cites.
Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. Continuous optimization , 111–146 (Springer)
2005
Earlier work this paper cites.
Wright M (2005) The interior-point revolution in optimization: history, recent developments, and lasting consequences. Bulletin of the American mathematical society 42(1):39–56
2005
Earlier work this paper cites.
Belomestny D, Milstein GN (2006) Monte carlo evaluation of american options using consumption processes. International Journal of theoretical and applied finance 9(04):455–481
2006
Earlier work this paper cites.
Kolodko A, Schoenmakers J (2006) Iterative construction of the optimal bermudan stopping time. Finance and Stochastics 10(1):27–49
2006
Earlier work this paper cites.
Chen N, Glasserman P (2007) Additive and multiplicative duals for american option pricing. Finance and Stochastics 11(2):153–179
2007
Cited alongside, same era.
Jamshidian F (2007) The duality of optimal exercise and domineering claims: A doob–meyer decomposition approach to the snell envelope. Stochastics An International Journal of Probability and Stochastic Processes 79(1-2):27–60
2007
Cited alongside, same era.
2007
Cited alongside, same era.
Schalekamp F (2007) Some Results In Universal And A Priori Optimization . Ph.D. thesis, Cornell University, Ph.D. Thesis
2007
Cited alongside, same era.
Baricz Á (2008) Mills’ ratio: Monotonicity patterns and functional inequalities. Journal of Mathematical Analysis and Applications 340(2):1362–1370
Balkanski E, Rubinstein A, Singer Y (2017) The limitations of optimization from samples. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , 1016–1027
2017
Later among the works it cites.
Beinker M, Schlenkrich S (2017) Accurate vega calculation for bermudan swaptions. Novel Methods in Computational Finance 65–82
2017
Later among the works it cites.
Boucherie RJ, Van Dijk NM (2017) Markov decision processes in practice (Springer)
2017
Later among the works it cites.
2017
Later among the works it cites.
Langrené N, Chen W, Zhu Z (2017) Field exploration: when to start extracting? Proceedings of the 22nd International Congress on Modelling and Simulation (MODSIM 2017), Hobart, Australia
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
De Klerk E (2008) The complexity of optimizing over a simplex, hypercube or sphere: a short survey. Central European Journal of Operations Research 16(2):111–125
2008
Cited alongside, same era.
Kohler M (2008) A regression-based smoothing spline monte carlo algorithm for pricing american options in discrete time. AStA Advances in Statistical Analysis 92(2):153–178
2008
Cited alongside, same era.
Arora S, Barak B (2009) Computational complexity: a modern approach (Cambridge University Press)
2009
Cited alongside, same era.
Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms (MIT press)
2009
Cited alongside, same era.
Denton BT, Kurt M, Shah ND, Bryant SC, Smith SA (2009) Optimizing the start time of statin therapy for patients with diabetes. Medical Decision Making 29(3):351–367
2009
Cited alongside, same era.
Abraham I, Fiat A, Goldberg AV, Werneck RF (2010) Highway dimension, shortest paths, and provably efficient algorithms. Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms , 782–793 (SIAM)
2010
Cited alongside, same era.
Brown DB, Smith JE, Sun P (2010) Information relaxations and duality in stochastic dynamic programs. Operations research 58(4-part-1):785–801
2010
Cited alongside, same era.
2017
Later among the works it cites.
2018
Closest in time.
Bezerra SC, Ohashi A, Russo F, de Souza F (2018) Discrete-type approximations for non-markovian optimal stopping problems: Part ii. Methodology and Computing in Applied Probability 1–35
2018
Closest in time.
Lelong J (2018) Dual pricing of american options by wiener chaos expansion. SIAM Journal on Financial Mathematics 9(2):493–519
2018
Closest in time.
Sidford A, Wang M, Wu X, Yang L, Ye Y (2018) Near-optimal time and sample complexities for solving markov decision processes with a generative model. Advances in Neural Information Processing Systems , 5186–5196
2018
Closest in time.
Becker S, Cheridito P, Jentzen A (2019) Deep optimal stopping. Journal of Machine Learning Research 20:74
2019
Closest in time.
Belomestny D, Hildebrand R, Schoenmakers J (2019) Optimal stopping via pathwise dual empirical maximisation. Applied Mathematics & Optimization 79(3):715–741
2019
Closest in time.
Correa J, Foncea P, Hoeksma R, Oosterwijk T, Vredeveld T (2019) Recent developments in prophet inequalities. ACM SIGecom Exchanges 17(1):61–70
2019
Closest in time.
Halman N, Nannicini G (2019) Toward breaking the curse of dimensionality: an fptas for stochastic dynamic programs with multidimensional actions and scalar states. SIAM Journal on Optimization 29(2):1131–1163
2019
Closest in time.
Leão D, Ohashi A, Russo F (2019) Discrete-type approximations for non-markovian optimal stopping problems: Part i. Journal of Applied Probability 56(4):981–1005
2019
Closest in time.
Belomestny D, Kaledin M, Schoenmakers J (2020) Semitractability of optimal stopping problems via a weighted stochastic mesh algorithm. Mathematical Finance 30(4):1591–1616
2020
Closest in time.
Chawla S, Gergatsouli E, Teng Y, Tzamos C, Zhang R (2020) Pandora’s box with correlations: Learning and approximation. 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , 1214–1225 (IEEE)
2020
Closest in time.
Du SS, Kakade SM, Wang R, Yang LF (2020) Is a good representation sufficient for sample efficient reinforcement learning? International Conference on Learning Representations
2020
Closest in time.
Ibáñez A, Velasco C (2020) Recursive lower and dual upper bounds for bermudan-style options. European Journal of Operational Research 280(2):730–740
2020
Closest in time.
Rubinstein A, Wang JZ, Weinberg SM (2020) Optimal single-choice prophet inequalities from samples. Innovations in Theoretical Computer Science
2020
Closest in time.
Aouad A, Segev D (2021) Display optimization for vertically differentiated locations under multinomial logit preferences. Management Science 67(6):3519–3550
2021
Closest in time.
Bayer C, Redmann M, Schoenmakers J (2021) Dynamic programming for optimal stopping via pseudo-regression. Quantitative Finance 21(1):29–44
2021
Closest in time.
Becker S, Cheridito P, Jentzen A, Welti T (2021) Solving high-dimensional optimal stopping problems using deep learning. European Journal of Applied Mathematics 32(3):470–514
2021
Closest in time.
Chen Y (2021) Efficient Algorithms for High-Dimensional Data-Driven Sequential Decision-Making . Ph.D. thesis, Cornell University
2021
Closest in time.
Emmerling TJ, Yavas A, Yildirim Y (2021) To accept or not to accept: Optimal strategy for sellers in real estate. Real Estate Economics 49(S1):268–296
2021
Closest in time.
Kisfaludi-Bak S, Nederlof J, Wegrzycki K (2022) A gap-eth-tight approximation scheme for euclidean tsp. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , 351–362 (IEEE)
2021
Closest in time.
Segev D, Singla S (2021) Efficient approximation schemes for stochastic probing and prophet problems. Proceedings of the 22nd ACM Conference on Economics and Computation , 793–794
2021
Closest in time.
Wang Y, Wang R, Kakade S (2021) An exponential lower bound for linearly realizable mdp with constant suboptimality gap. Advances in Neural Information Processing Systems 34:9521–9533
2021
Closest in time.
Alaei S, Makhdoumi A, Malekian A, Pekeč S (2022) Revenue-sharing allocation strategies for two-sided media platforms: Pro-rata vs. user-centric. Management Science
2022
Closest in time.
Ciocan DF, Mišić VV (2022) Interpretable optimal stopping. Management Science 68(3):1616–1638
2022
Closest in time.
Derakhshan M, Golrezaei N, Manshadi V, Mirrokni V (2022) Product ranking on online platforms. Management Science 68(6):4024–4041
2022
Closest in time.
2023
Closest in time.
Sturt B (2023) A nonparametric algorithm for optimal stopping based on robust optimization. Operations Research 71(5):1530–1557
2023
Closest in time.
2023
Closest in time.
Glasserman P, Yu B, et al. (2004) Number of paths versus number of basis functions in american option pricing. The Annals of Applied Probability 14(4):2090–2119
2090
Closest in time.