Competitive difference analysis of the one-way trading problem with limited information
From MaRDI portal
Recommendations
- Competitive algorithms for unbounded one-way trading
- Competitive algorithms for unbounded one-way trading
- Optimal search and one-way trading online algorithms
- Average-case competitive analyses for one-way trading
- Constant competitive algorithms for unbounded one-way trading under monotone hazard rate
Cites work
- scientific article; zbMATH DE number 3750642 (Why is no real title available?)
- A comparison of performance measures via online search
- A note: An improved upper bound for the online inventory problem with bounded storage and order costs
- Average-case competitive analyses for one-way trading
- Competitive analysis of the online inventory problem
- How much is it worth to know the future in online conversion problems?
- Online algorithms for the general k-search problem
- Online algorithms for the multiple time series search problem
- Online search with time-varying price bounds
- Optimal algorithms for \(k\)-search with application in option pricing
- Optimal algorithms for online time series search and one-way trading with interrelated prices
- Optimal algorithms for the online time series search problem
- Optimal buy-and-hold strategies for financial markets with bounded daily returns
- Optimal search and one-way trading online algorithms
- The Theory of Statistical Decision
Cited in
(4)- 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 cash management problem with uncertain demands
This page was built for publication: Competitive difference analysis of the one-way trading problem with limited information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322991)
