The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives
Open accessAbstract
The authors develop a theory characterizing optimal stopping times for discrete-time ergodic Markov processes with discounted rewards. The theory differs from prior work by its view of per-stage and terminal reward functions as elements of a certain Hilbert space. In addition to a streamlined analysis establishing existence and uniqueness of a solution to Bellman's equation, this approach provides an elegant framework for the study of approximate solutions. In particular, the authors propose a stochastic approximation algorithm that tunes weights of a linear combination of basis functions in order to approximate a value function. They prove that this algorithm converges (almost surely) and that the limit of convergence has some desirable properties. The utility of the approximation method is illustrated via a computational case study involving the pricing of a path dependent financial derivative security that gives rise to an optimal stopping problem with a 100-dimensional state space.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The pricing of options and corporate liabilities
Black, F., & Scholes, M. (1973) · Journal of Political Economy · doi:10.1086/260062 · Cited by 29,074
(1995) · Cited by 10,558
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Theory of Rational Option Pricing
Merton, R. C. (2019) · World Scientific Reference on Contingent Claims Analysis in Corporate Finance · doi:10.1142/9789814759588_0002 · Cited by 7,948
Theory of rational option pricing
Merton, R. C. (2005) · Theory of Valuation · doi:10.1142/9789812701022_0008 · Cited by 7,161
Watkins, C. (1989) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.17863/cam.132164 · Cited by 5,297
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
Martingales and arbitrage in multiperiod securities markets
Harrison, J. M., & Kreps, D. M. (1979) · Journal of Economic Theory · doi:10.1016/0022-0531(79)90043-7 · Cited by 3,593
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Martingales and stochastic integrals in the theory of continuous trading
Harrison, J. M., & Pliska, S. R. (1981) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(81)90026-0 · Cited by 2,835
Cited by
Valuing American Options by Simulation: A Simple Least-Squares Approach
Longstaff, F. A., & Schwartz, E. S. (2001) · Review of Financial Studies · doi:10.1093/rfs/14.1.113 · Cited by 3,216
Algorithms for Reinforcement Learning
Szepesvári, C. (2010) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01551-9 · Cited by 1,049
Regression methods for pricing complex American-style options
Tsitsiklis, J. N., & Van Roy, B. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.935083 · Cited by 612
Self-citationLearning to trade via direct reinforcement
Moody, J., & Saffell, M. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.935097 · Cited by 535
Pricing American Options: A Duality Approach
Haugh, M. B., & Kogan, L. (2004) · Operations Research · doi:10.1287/opre.1030.0070 · Cited by 452
Kernel-Based Reinforcement Learning
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100235 · Cited by 367
Optimal Portfolio Choice and the Valuation of Illiquid Securities
Longstaff, F. A. (2001) · Review of Financial Studies · doi:10.1093/rfs/14.2.407 · Cited by 320
A Review of Safe Reinforcement Learning: Methods, Theories, and Applications
Gu, S., Yang, L., Du, Y., Chen, G., Walter, F., Wang, J., & Knoll, A. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3457538 · Cited by 315
Approximate policy iteration: a survey and some new methods
Bertsekas, D. P. (2011) · Journal of Control Theory and Applications · doi:10.1007/s11768-011-1005-3 · Cited by 273
Risk-Sensitive Reinforcement Learning
Mihatsch, O., & Neuneier, R. (2002) · Machine Learning · doi:10.1023/a:1017940631555 · Cited by 258
Kernel-Based Reinforcement Learning
Ormoneit, D., & Sen, Ś. (2002) · Machine Learning · doi:10.1023/a:1017928328829 · Cited by 255
Quantitative Trading on Stock Market Based on Deep Reinforcement Learning
WU, J., WANG, C., XIONG, L., & SUN, H. (2019) · 2019 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2019.8851831 · Cited by 42
Metadata
- Authors
- Tsitsiklis, J. N., & van Roy, B.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1999
- Volume
- 44
- Issue
- 10
- Pages
- 1840-1851
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2156168464
- Cited by
- 326
- References
- 21
- FWCI
- 12.99
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.