An online trading problem with an increasing number of available products
From MaRDI portal
Publication:2168746
DOI10.1007/s10878-021-00841-yzbMath1498.91310MaRDI QIDQ2168746
Wen-Ming Zhang, Ye Zhang, Yongxi Cheng, Shankui Zheng
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00841-y
Cites Work
- Unnamed Item
- 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
- Average-case competitive analyses for one-way trading
- Optimal algorithms for \(k\)-search with application in option pricing
- Competitive algorithms for unbounded one-way trading
- Online search with time-varying price bounds
- Lot sizing and scheduling -- survey and extensions
- Competitive analysis of bi-directional non-preemptive conversion
- Optimal online algorithms for the multi-objective time series search problem
- Online algorithms for the multiple time series search problem
- Online algorithms for the general \(k\)-search problem
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Constant competitive algorithms for unbounded one-way trading under monotone hazard rate
- Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns
- Competitive Analysis for Multi-objective Online Algorithms
- Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices
- Online Two Stage k-Search Problem and Its Competitive Analysis
- The Theory of Statistical Decision
- Optimal online two-way trading with bounded number of transactions
- Optimal search and one-way trading online algorithms
