Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2213977.2214070acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Minimax option pricing meets black-scholes in the limit

Published: 19 May 2012 Publication History

Abstract

Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset's future market price. In short, an option has a particular payout that is based on the market price for an asset on a given date in the future. In 1973, Black and Scholes proposed a valuation model for options that essentially estimates the tail risk of the asset price under the assumption that the price will fluctuate according to geometric Brownian motion. A key element of their analysis is that the investor can "hedge" the payout of the option by continuously buying and selling the asset depending on the price fluctuations. More recently, DeMarzo et al. proposed a more robust valuation scheme which does not require any assumption on the price path; indeed, in their model the asset's price can even be chosen adversarially. This framework can be considered as a sequential two-player zero-sum game between the investor and Nature. We analyze the value of this game in the limit, where the investor can trade at smaller and smaller time intervals. Under weak assumptions on the actions of Nature (an adversary), we show that the minimax option price asymptotically approaches exactly the Black-Scholes valuation. The key piece of our analysis is showing that Nature's minimax optimal dual strategy converges to geometric Brownian motion in the limit.

Supplementary Material

JPG File (stoc_12a_3.jpg)
MP4 File (stoc_12a_3.mp4)

References

[1]
J. Abernethy, A. Agarwal, P.L. Bartlett, and A. Rakhlin. A stochastic view of optimal regret through minimax duality. In COLT, 2009.
[2]
F. Black and M. Scholes. The pricing of options and corporate liabilities. The Journal of Political Economy, 81(3):637--654, 1973.
[3]
N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
[4]
P. DeMarzo, I. Kremer, and Y. Mansour. Online trading algorithms and robust option pricing. In STOC, pages 477--486, 2006.
[5]
R. Durrett. Probability: Theory and Examples (Third Edition). Cambridge University Press, 2004.
[6]
Y. Freund and R.E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. In EuroCOLT, volume 904 of Lecture Notes in Computer Science, pages 23--37. Springer, 1995.
[7]
E. Gofer and Y. Mansour. Pricing exotic derivatives using regret minimization. In SAGT, volume 6982 of Lecture Notes in Computer Science, pages 266--277. Springer, 2011.
[8]
E. Gofer and Y. Mansour. Regret minimization algorithms for pricing lookback options. In ALT, volume 6925 of Lecture Notes in Computer Science, pages 234--248. Springer, 2011.
[9]
N. Littlestone and M.K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212--261, 1994.
[10]
J. Von Neumann, O. Morgenstern, H.W. Kuhn, and A. Rubinstein. Theory of Games and Economic Behavior. Princeton University Press, 1947.
[11]
G. Shafer and V. Vovk. Probability and Finance: It's Only a Game! Wiley-Interscience, 2001.
[12]
M. Sion. On general minimax theorems. Pacific Journal of Mathematics, 8(1):171--176, 1958.
[13]
A.W. Van der Vaart. Asymptotic Statistics. Cambridge University Press, 2000.
[14]
V. Vovk. Pricing european options without probability. Technical report, CLRC-TR-99--4, Computer Learning Research Centre, Royal Holloway, University of London, 1995.

Cited By

View all
  • (2020)Optimal anytime regret for two experts2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00132(1404-1415)Online publication date: Nov-2020
  • (2020)Learning agents in Black–Scholes financial marketsRoyal Society Open Science10.1098/rsos.2011887:10(201188)Online publication date: 21-Oct-2020
  • (2019)Robust Option Pricing Under Change of NuméraireComputer Engineering and Technology10.1007/978-981-13-5919-4_7(68-82)Online publication date: 6-Jan-2019
  • Show More Cited By

Index Terms

  1. Minimax option pricing meets black-scholes in the limit

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing
    May 2012
    1310 pages
    ISBN:9781450312455
    DOI:10.1145/2213977
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 19 May 2012

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. black-scholes
    2. game theory
    3. geometric brownian motion
    4. minimax analysis
    5. option pricing

    Qualifiers

    • Research-article

    Conference

    STOC'12
    Sponsor:
    STOC'12: Symposium on Theory of Computing
    May 19 - 22, 2012
    New York, New York, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)9
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 24 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2020)Optimal anytime regret for two experts2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00132(1404-1415)Online publication date: Nov-2020
    • (2020)Learning agents in Black–Scholes financial marketsRoyal Society Open Science10.1098/rsos.2011887:10(201188)Online publication date: 21-Oct-2020
    • (2019)Robust Option Pricing Under Change of NuméraireComputer Engineering and Technology10.1007/978-981-13-5919-4_7(68-82)Online publication date: 6-Jan-2019
    • (2018)Learning Agents in Financial MarketsProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3238087(2106-2108)Online publication date: 9-Jul-2018
    • (2018)Introduction to Online Convex OptimizationFoundations and Trends in Optimization10.1561/24000000132:3-4(157-325)Online publication date: 11-Dec-2018
    • (2016)Online Discrete Optimization in Social Networks in the Presence of Knightian UncertaintyOperations Research10.1287/opre.2015.143264:3(662-679)Online publication date: Jun-2016
    • (2015)Fractal Structures in Adversarial PredictionProceedings of the 2015 Conference on Innovations in Theoretical Computer Science10.1145/2688073.2688088(75-84)Online publication date: 11-Jan-2015
    • (2014)Online discrete optimization in social networks2014 American Control Conference10.1109/ACC.2014.6858819(3796-3801)Online publication date: Jun-2014
    • (2013)Minimax optimal algorithms for unconstrained linear optimizationProceedings of the 27th International Conference on Neural Information Processing Systems - Volume 210.5555/2999792.2999916(2724-2732)Online publication date: 5-Dec-2013
    • (2013)How to hedge an option against an adversaryProceedings of the 27th International Conference on Neural Information Processing Systems - Volume 210.5555/2999792.2999874(2346-2354)Online publication date: 5-Dec-2013
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media