Online algorithms for the multiple time series search problem
From MaRDI portal
Recommendations
Cites work
- Average-case competitive analyses for one-way trading
- scientific article; zbMATH DE number 5016447 (Why is no real title available?)
- Online search with time-varying price bounds
- Optimal algorithms for \(k\)-search with application in option pricing
- Optimal algorithms for the online time series search problem
- Optimal search and one-way trading online algorithms
- Optimal selection based on relative rank (the 'Secretary Problem')
- Optimal stopping problems by two or more decision makers: a survey
- Optimal stopping with sampling cost: The secretary problem
- Secretary problems with inspection costs as a game
- Secretary problems: weights and discounts
- Who solved the secretary problem
Cited in
(10)- Online search with time-varying price bounds
- Competitive analysis of price online inventory problem with cost function
- Optimal replenishment under price uncertainty
- 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
- Competitive difference analysis of the one-way trading problem with limited information
- scientific article; zbMATH DE number 7234490 (Why is no real title available?)
- Optimal Algorithms for the Online Time Series Search Problem
- Online (J, K)-search problem and its competitive analysis
- Optimal algorithms for the online time series search problem
This page was built for publication: Online algorithms for the multiple time series search problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762061)