Online search with time-varying price bounds
From MaRDI portal
Publication:1031868
DOI10.1007/S00453-007-9156-9zbMath1183.68226OpenAlexW2093226551MaRDI QIDQ1031868
Phuong Hoai Ha, Philippas Tsigas, Peter Damaschke
Publication date: 23 October 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9156-9
Related Items (17)
Online Two Stage k-Search Problem and Its Competitive Analysis ⋮ 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 ⋮ Competitive analysis of bi-directional non-preemptive conversion ⋮ Optimal algorithms for the online time series search problem ⋮ Optimal algorithms for online time series search and one-way trading with interrelated prices ⋮ Online algorithms for the general \(k\)-search problem ⋮ Optimal replenishment under price uncertainty ⋮ COMPETITIVE ANALYSIS OF INTERRELATED PRICE ONLINE INVENTORY PROBLEMS WITH DEMANDS ⋮ How much is it worth to know the future in online conversion problems? ⋮ Online \((J, K)\)-search problem and its competitive analysis ⋮ Competitive analysis of online inventory problem with interrelated prices ⋮ Online algorithms for the multiple time series search problem ⋮ Optimal online \(k\)-min search ⋮ Optimal online two-way trading with bounded number of transactions ⋮ Online k-max Search Algorithms with Applications to the Secretary Problem
Cites Work
This page was built for publication: Online search with time-varying price bounds
