Online algorithms for the multiple time series search problem

DOI10.1016/J.COR.2011.07.011zbMath1251.91049OpenAlexW2076181989MaRDI QIDQ1762061

Feifeng Zheng, Yucheng Dong, Wen-Ming Zhang, Yin-Feng Xu

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.07.011

zbMATH Keywords

competitive ratioonline algorithmtime series search

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Economic time series analysis (91B84) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Competitive difference analysis of the one-way trading problem with limited information ⋮ Competitive analysis of price online inventory problem with cost function ⋮ An online trading problem with an increasing number of available products ⋮ An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands ⋮ Optimal replenishment under price uncertainty ⋮ Online \((J, K)\)-search problem and its competitive analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal algorithms for the online time series search problem
• Average-case competitive analyses for one-way trading
• Optimal algorithms for \(k\)-search with application in option pricing
• Optimal stopping problems by two or more decision makers: a survey
• Online search with time-varying price bounds
• Optimal stopping with sampling cost: The secretary problem
• Secretary problems with inspection costs as a game
• Who solved the secretary problem
• Optimal selection based on relative rank (the 'Secretary Problem')
• Optimal search and one-way trading online algorithms

This page was built for publication: Online algorithms for the multiple time series search problem