Competitive algorithms for unbounded one-way trading
From MaRDI portal
Publication:897958
DOI10.1016/j.tcs.2015.05.034zbMath1332.68295OpenAlexW646988672MaRDI QIDQ897958
Luping Zhang, Bin Fu, Jueliang Hu, Hing-Fung Ting, Jiuling Guo, Shuguang Han, Yong Zhang, Diwei Zhou, Francis Y. L. Chin, Ming-Hui Jiang, Guo-Hui Lin
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.034
Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27)
Related Items (7)
An online trading problem with an increasing number of available products ⋮ Offline and online algorithms for single-minded selling problem ⋮ Constant competitive algorithms for unbounded one-way trading under monotone hazard rate ⋮ Exact and approximation algorithms for PMMS under identical constraints ⋮ Optimal replenishment under price uncertainty ⋮ Competitive analysis of online inventory problem with interrelated prices ⋮ Optimal online two-way trading with bounded number of transactions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average-case competitive analyses for one-way trading
- Online pricing for bundles of multiple items
- Optimal algorithms for \(k\)-search with application in option pricing
- Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns
- COMPETITIVE ALGORITHMS FOR ONLINE PRICING
- Optimal Inventory Policies When Ordering Prices are Random
- Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
- Welfare and Profit Maximization with Production Costs
- Optimal search and one-way trading online algorithms
This page was built for publication: Competitive algorithms for unbounded one-way trading