Optimal Algorithms for k-Search with Application in Option Pricing

In the k-search problem, a player is searching for the k highest (respectively, lowest) prices in a sequence, which is revealed to her sequentially. At each quotation, the player has to decide immediately whether to accept the price or not. Using the competitive ratio as a performance measure, we give optimal deterministic and randomized algorithms for both the maximization and minimization problems, and discover that the problems behave substantially different in the worst-case. As an application of our results, we use these algorithms to price “lookback options”, a particular class of financial derivatives. We derive bounds for the price of these securities under a no-arbitrage assumption, and compare this to classical option pricing.

[1]  D. Rosenfield,et al.  Optimal adaptive price search , 1981 .

[2]  L H Loomis,et al.  On A Theorem of von Neumann. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[3]  R. C. Merton,et al.  Option pricing when underlying stock returns are discontinuous , 1976 .

[4]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[5]  Ralf Korn,et al.  Worst-case scenario investment for insurers , 2005 .

[6]  S. Lippman,et al.  THE ECONOMICS OF JOB SEARCH: A SURVEY* , 1976 .

[7]  W. C. Hunter,et al.  Path-dependent options , 1992 .

[8]  Steven E. Shreve,et al.  Continuous-Time Models , 2021, Economic Modeling and Inference.

[9]  R. Cont.  Empirical properties of asset returns: stylized facts and statistical issues , 2001 .

[10]  Ran El-Yaniv,et al.  Optimal Search and One-Way Trading Online Algorithms , 2001, Algorithmica.

[11]  M. Goldman,et al.  Path Dependent Options: "Buy at the Low, Sell at the High" , 1979 .

[12]  J. Hull.  Options, Futures, and Other Derivatives , 1989 .

[13]  Nimrod Megiddo,et al.  Improved Algorithms and Analysis for Secretary Problems and Generalizations , 2001, SIAM J. Discret. Math..

[14]  D. Epstein,et al.  A New Model for Interest Rates , 1998 .

[15]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[16]  R. Cont,et al.  Financial Modelling with Jump Processes , 2003 .

[17]  S. Shreve.  Stochastic calculus for finance , 2004 .

[18]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[19]  Richard S. Varga,et al.  Proof of Theorem 5 , 1983 .

[20]  F. Black,et al.  The Pricing of Options and Corporate Liabilities , 1973, Journal of Political Economy.

[21]  S. Lippman,et al.  Chapter 6 The economics of uncertainty: Selected topics and probabilistic methods , 1981 .

[22]  Yishay Mansour,et al.  Online trading algorithms and robust option pricing , 2006, STOC '06.

[23]  S. Heston.  A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options , 1993 .

[24]  Robert D. Kleinberg.  A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.