@inproceedings{9eb6e2a67190486fa333a173073c3f4e,
title = "Optimal algorithms for the online time series search problem",
abstract = "In the problem of online time series search introduced by El-Yaniv et al. [4], a player observes prices one by one over time and shall select exactly one of the prices on its arrival without the knowledge of future prices, aiming to maximize the selected price. In this paper, we extend the problem by introducing profit function. Considering two cases where the search duration is either known or unknown beforehand, we propose two optimal deterministic algorithms respectively. The models and results in the paper generalize those of El-Yaniv et al. [4].",
keywords = "Competitive Ratio, Online Algorithm, Profit Function, Time Series Search",
author = "Yinfeng Xu and Wenming Zhang and Feifeng Zheng",
year = "2009",
doi = "10.1007/978-3-642-02026-1\_30",
language = "英语",
isbn = "3642020259",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "322--333",
booktitle = "Combinatorial Optimization and Applications - Third International Conference, COCOA 2009, Proceedings",
note = "3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009 ; Conference date: 10-06-2009 Through 12-06-2009",
}