Optimal online k-min search

Ahmad I, Schmidt G (2012) An experimental analysis of online unidirectional conversion problem. In: Huemer C, Lops P (eds) E-Commerce and web technologies. Lecture notes in business information processing, vol 123, pp 176–187. Springer, New York

al-Binali, 1999, A risk-reward framework for the competitive analysis of financial games, Algorithmica, 25, 99, 10.1007/PL00009285

Chen, 2001, Optimal buy-and-hold strategies for financial markets with bounded daily returns, SIAM J Comput, 31, 447, 10.1137/S0097539799358847

Damaschke, 2009, Online search with time-varying price bounds, Algorithmica, 55, 619, 10.1007/s00453-007-9156-9

El-Yaniv R, Fiat A, Karp RM, Turpin G (1992) Competitive analysis of financial games. In: IEEE symposium on foundations of computer science, pp 327–333

El-Yaniv, 2001, Optimal search and one-way trading algorithm, Algorithmica, 30, 101, 10.1007/s00453-001-0003-0

Kao, 1999, On-line difference maximization, SIAM J Discrete Math, 12, 78, 10.1137/S0895480196307445

Lorenz, 2009, Optimal algorithms for k-search with application in option pricing, Algorithmica, 55, 311, 10.1007/s00453-008-9217-8

Xu, 2011, Optimal algorithms for the online time series search problem, Theor Comput Sci, 412, 192, 10.1016/j.tcs.2009.09.026

Zhang, 2011, Online algorithms for the general k-search problem, Inf Process Lett, 111, 678, 10.1016/j.ipl.2011.04.008