Online \((J, K)\)-search problem and its competitive analysis

DOI10.1016/j.tcs.2015.06.005zbMath1330.68352OpenAlexW589149893MaRDI QIDQ501005

Yong-Cai Geng, Sumit K. Garg

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.005

zbMATH Keywords

online algorithmscompetitive ratioonline search problem

Mathematics Subject Classification ID

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

Related Items (2)

An online trading problem with an increasing number of available products ⋮ Optimal replenishment under price uncertainty

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
• Online search with time-varying price bounds
• Online algorithms for the multiple time series search problem
• Online algorithms for the general \(k\)-search problem
• On variants of the matroid 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 \((J, K)\)-search problem and its competitive analysis