Online algorithms for the general \(k\)-search problem

DOI10.1016/j.ipl.2011.04.008zbMath1260.91117OpenAlexW1986329165MaRDI QIDQ1944112

Feifeng Zheng, Wen-Ming Zhang, Ming Liu, Yin-Feng Xu

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.04.008

zbMATH Keywords

competitive ratioonline algorithmtime series searchone-way trading

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Competitive difference analysis of the one-way trading problem with limited information ⋮ An online trading problem with an increasing number of available products ⋮ Competitive analysis of bi-directional non-preemptive conversion ⋮ Optimal replenishment under price uncertainty ⋮ Online \((J, K)\)-search problem and its competitive analysis ⋮ Optimal online \(k\)-min search

Cites Work

• 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
• Online search with time-varying price bounds
• Optimal search and one-way trading online algorithms

This page was built for publication: Online algorithms for the general \(k\)-search problem