The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the Relation Between Option and Stock Prices: A Convex Optimization Approach
Open accessAbstract
The idea of investigating the relation of option and stock prices based just on the no-arbitrage assumption, but without assuming any model for the underlying price dynamics, has a long history in the financial economics literature. We introduce convex and, in particular semidefinite optimization methods, duality, and complexity theory to shed new light on this relation. For the single stock problem, given moments of the prices of the underlying assets, we show that we can find best-possible bounds on option prices with general payoff functions efficiently, either algorithmically (solving a semidefinite optimization problem) or in closed form. Conversely, given observable option prices, we provide best-possible bounds on moments of the prices of the underlying assets, as well as on the prices of other options on the same asset by solving linear optimization problems. For options that are affected by multiple stocks either directly (the payoff of the option depends on multiple stocks) or indirectly (we have information on correlations between stock prices), we find nonoptimal bounds using convex optimization methods. However, we show that it is NP-hard to find best possible bounds in multiple dimensions. We extend our results to incorporate transactions costs.
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
Some NP-complete problems in quadratic and nonlinear programming
Murty, K. G., & Kabadi, S. N. (1987) · Mathematical Programming · doi:10.1007/bf02592948 · Cited by 1,003
Cited by
A Robust Optimization Approach to Inventory Theory
Bertsimas, D., & Thiele, A. (2006) · Operations Research · doi:10.1287/opre.1050.0238 · Cited by 705
Self-citationWorst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Ghaoui, L. E., Oks, M., & Oustry, F. (2003) · Operations Research · doi:10.1287/opre.51.4.543.16101 · Cited by 662
Regret in the Newsvendor Model with Partial Information
Perakis, G., & Roels, G. (2008) · Operations Research · doi:10.1287/opre.1070.0486 · Cited by 355
Optimization Methods in Finance
Cornuejols, G., & Tütüncü, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511753886 · Cited by 347
Mohajerin Esfahani, P., & Kuhn, D. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1172-1 · Cited by 136
Metadata
- Authors
- Bertsimas, D., & Popescu, I.
- Venue
- Operations Research
- Published
- 2002-04
- Volume
- 50
- Issue
- 2
- Pages
- 358-374
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2152027968
- Cited by
- 203
- References
- 1
- FWCI
- 18.58
- 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.