Regret minimization algorithms for pricing lookback options

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, we extend the applicability of regret minimization to pricing financial instruments, following the work of [11]. More specifically, we consider pricing a type of exotic option called a fixed-strike lookback call option. A fixed-strike lookback call option has a known expiration time, at which the option holder has the right to receive the difference between the maximal price of a stock and some pre-agreed price. We derive upper bounds on the price of these options, assuming an arbitrage-free market, by developing two-way trading algorithms. We construct our trading algorithms by combining regret minimization algorithms and one-way trading algorithms. Our model assumes upper bounds on the absolute daily returns, overall quadratic variation, and stock price, otherwise allowing for fully adversarial market behavior. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Gofer, E., & Mansour, Y. (2011). Regret minimization algorithms for pricing lookback options. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6925 LNAI, pp. 234–248). https://doi.org/10.1007/978-3-642-24412-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free