The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Pricing American Options: A Duality Approach
Abstract
We develop a new method for pricing American options. The main practical contribution of this paper is a general algorithm for constructing upper and lower bounds on the true price of the option using any approximation to the option price. We show that our bounds are tight, so that if the initial approximation is close to the true price of the option, the bounds are also guaranteed to be close. We also explicitly characterize the worst-case performance of the pricing bounds. The computation of the lower bound is straightforward and relies on simulating the suboptimal exercise strategy implied by the approximate option price. The upper bound is also computed using Monte Carlo simulation. This is made feasible by the representation of the American option price as a solution of a properly defined dual minimization problem, which is the main theoretical result of this paper. Our algorithm proves to be accurate on a set of sample problems where we price call options on the maximum and the geometric mean of a collection of stocks. These numerical results suggest that our pricing method can be successfully applied to problems of practical interest.
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
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Numerical recipes in Pascal: the art of scientific computing
(1990) · Choice Reviews Online · doi:10.5860/choice.27-5158 · Cited by 11,811
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Numerical Recipes in C: The Art of Scientific Computing.
Birchenhall, C., Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · The Economic Journal · doi:10.2307/2234664 · Cited by 4,355
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
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
Ingersoll, J. E., & Duffie, D. (1993) · The Journal of Finance · doi:10.2307/2329081 · Cited by 2,891
Random Number Generation and Quasi-Monte Carlo Methods.
Collings, B. J., & Niederreiter, H. (1993) · Journal of the American Statistical Association · doi:10.2307/2290359 · Cited by 2,884
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
Neuro-Dynamic Programming: NDP
Bertsekas, D. P. (2001) · Encyclopedia of Optimization · doi:10.1007/0-306-48332-7_333 · Cited by 1,466
Monte Carlo methods for security pricing
Boyle, P., Broadie, M., & Glasserman, P. (1997) · Journal of Economic Dynamics and Control · doi:10.1016/s0165-1889(97)00028-6 · Cited by 854
The American Put Option Valued Analytically
GESKE, R., & JOHNSON, H. E. (1984) · The Journal of Finance · doi:10.1111/j.1540-6261.1984.tb04921.x · Cited by 728
A Nonparametric Approach to Pricing and Hedging Derivative Securities Via Learning Networks
HUTCHINSON, J. M., LO, A. W., & POGGIO, T. (1994) · The Journal of Finance · doi:10.1111/j.1540-6261.1994.tb00081.x · Cited by 717
Pricing American-style securities using simulation
Broadie, M. N., & Glasserman, P. (1997) · Journal of Economic Dynamics and Control · doi:10.1016/s0165-1889(97)00029-8 · Cited by 638
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
On the pricing of American options
Karatzas, I. (1988) · Applied Mathematics & Optimization · doi:10.1007/bf01448358 · Cited by 382
Faster Valuation of Financial Derivatives
Paskov, S. H., & Traub, J. F. (1995) · The Journal of Portfolio Management · doi:10.3905/jpm.1995.409541 · Cited by 368
Introduction to Mathematical Finance
(2000) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/057 · Cited by 343
Tsitsiklis, J. N., & van Roy, B. (1999) · IEEE Transactions on Automatic Control · doi:10.1109/9.793723 · Cited by 326
Numerical Valuation of High Dimensional Multivariate American Securities
Barraquand, J., & Martineau, D. (1995) · The Journal of Financial and Quantitative Analysis · doi:10.2307/2331347 · Cited by 325
On the theory of option pricing
Bensoussan, A. (1984) · Acta Applicandae Mathematicae · doi:10.1007/bf00046576 · Cited by 287
Uniform Random Numbers: Theory and Practice
Tezuka, S. (1995) · Cited by 247
Quasi-Monte Carlo Methods in Numerical Finance
Joy, C., Boyle, P. P., & Tan, K. S. (1996) · Management Science · doi:10.1287/mnsc.42.6.926 · Cited by 243
Tezuka, S. (1995) · Springer eBooks · doi:10.1007/978-1-4615-2317-8 · Cited by 196
Intelligent Systems for Finance and Business
Goonatilake, S., & Treleaven, P. C. (1995) · John Wiley & Sons, Inc. eBooks · Cited by 130
Sobol, I. M. (1971) · Medical Entomology and Zoology · Cited by 84
Cited by
DGM: A deep learning algorithm for solving partial differential equations
Sirignano, J., & Spiliopoulos, K. (2018) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.08.029 · Cited by 2,208
Proceedings of Winter Simulation Conference
(1994) · Proceedings of Winter Simulation Conference WSC-94 · doi:10.1109/wsc.1994.717062 · Cited by 540
Monte Carlo and Quasi-Monte Carlo Sampling
(2009) · Springer Series in Statistics · doi:10.1007/978-0-387-78165-5 · Cited by 497
Macro, Finance, and Macro Finance: Solving Nonlinear Models in Continuous Time with Machine Learning
Duarte, V. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.3012602 · Cited by 9
Metadata
- Authors
- Haugh, M. B., & Kogan, L.
- Venue
- Operations Research
- Published
- 2004-04
- Volume
- 52
- Issue
- 2
- Pages
- 258-270
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W3122113998
- Cited by
- 452
- References
- 29
- FWCI
- 35.41
- Type
- journal article
- Language
- en
- Open access
- closed
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.