Optimal Algorithms for the Online Time Series Search Problem
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Optimal algorithms for the online time series search problem
Theoretical Computer Science
Online algorithms for the general k-search problem
Information Processing Letters
Online algorithms for the multiple time series search problem
Computers and Operations Research
Regret minimization algorithms for pricing lookback options
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Optimal algorithms for online time series search and one-way trading with interrelated prices
Journal of Combinatorial Optimization
How much is it worth to know the future in online conversion problems?
Discrete Applied Mathematics
Hi-index | 0.00 |
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.