Online search with time-varying price bounds

DOI10.1007/s00453-007-9156-9zbMath1183.68226MaRDI 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

zbMATH Keywords

game theorycompetitive analysisonline algorithmssearch algorithms

Mathematics Subject Classification ID

68P10: Searching and sorting

68W05: Nonnumerical algorithms

Related Items

Online Two Stage k-Search Problem and Its Competitive Analysis, COMPETITIVE ANALYSIS OF INTERRELATED PRICE ONLINE INVENTORY PROBLEMS WITH DEMANDS, Optimal online two-way trading with bounded number of transactions, Competitive difference analysis of the one-way trading problem with limited information, Optimal algorithms for online time series search and one-way trading with interrelated prices, Online \((J, K)\)-search problem and its competitive analysis, Optimal algorithms for the online time series search problem, Competitive analysis of online inventory problem with interrelated prices, Competitive analysis of price online inventory problem with cost function, Competitive analysis of bi-directional non-preemptive conversion, Optimal replenishment under price uncertainty, Online algorithms for the multiple time series search problem, Online algorithms for the general \(k\)-search problem, An online trading problem with an increasing number of available products, How much is it worth to know the future in online conversion problems?, Optimal online \(k\)-min search, Online k-max Search Algorithms with Applications to the Secretary Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Self-tuning reactive diffracting trees
• Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns
• Randomized wait-free concurrent objects (extended abstract)
• Optimal search and one-way trading online algorithms