Optimal algorithms for the online time series search problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5573 LNCS, Issue , 2009, Pages 322-333

  Xu, Yinfeng ^a,b   Zhang, Wenming ^a,b   Zheng, Feifeng ^a,b  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Competitive Ratio; Online Algorithm; Profit Function; Time Series Search

Indexed keywords

COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; ONLINE ALGORITHM; ONLINE TIME; OPTIMAL ALGORITHM; PROFIT FUNCTION; SEARCH PROBLEM;

BEVERAGES; COMBINATORIAL OPTIMIZATION; COSTS; PROFITABILITY; TIME SERIES;

ALGORITHMS;

EID: 70350635387     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02026-1_30     Document Type: Conference Paper

References (10)

1. Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary Problems: Weights and Discounts, http://zeno.siam.org/proceedings/soda/2009/ SODA09-135-babaioffm.pdf
2. Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online Auctions and Generalized Secretary Problems. ACM SIGecom Exchanges 7(2), 1-11 (2008)
3. Damaschke, P., Ha, P.H., Tsigas, P.: Online Search with Time-Varying Price Bounds. Algorithmica (to appear)
4. El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal Search and One-Way Trading Online Algorithms. Algorithmica 30(1), 101-139 (2001)
5. Ferguson, T.S.: Who Solved the Secretary Problem? Statistical Science 4(3), 282-296 (1989)
6. Grant, P.: Secretary Problems with Inspection Costs as a Game. Metrika 29, 87-93 (1982)
7. Lorenz, J., Panagiotou, K., Steger, A.: Optimal Algorithms for k-Search with Application in Option Pricing. Algorithmica (to appear)
8. Peskir, G., Shiryaev, A.: Optimal Stopping and Free-Boundary Problems. Birkhäuser, Basel (2006)
9. Rosenfield, D.B., Shapiro, R.D.: Optimal Adaptive Price Search. Journal of Economic Theory 25(1), 1-20 (1981)
10. Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Communication of the ACM 28, 202-208 (1985)