Competitive algorithms for unbounded one-way trading
type: Item
instance of: scholarly article
title: Competitive algorithms for unbounded one-way trading
zbMATH Open document ID: 1332.68295
author: Bin Fu
author: Jiuling Guo
author: Shuguang Han
author: Jueliang Hu
author: Hing-Fung Ting
author: Luping Zhang
author: Yong Zhang
author: Diwei Zhou
author: Francis Y. L. Chin
author: Minghui Jiang
author: Guohui Lin
published in: Theoretical Computer Science
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 91B26
zbMATH DE Number: 6517486
zbMATH Keywords: online algorithms
zbMATH Keywords: one-way trading
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.05.034
OpenAlex ID: W646988672
cites work: Near-optimal online auctions
cites work: Welfare and Profit Maximization with Production Costs
cites work: Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
cites work: Optimal buy-and-hold strategies for financial markets with bounded daily returns
cites work: Q4230356
cites work: Optimal search and one-way trading online algorithms
cites work: Average-case competitive analyses for one-way trading
cites work: Optimal Inventory Policies When Ordering Prices are Random
cites work: Optimal algorithms for \(k\)-search with application in option pricing
cites work: Q3993418
cites work: COMPETITIVE ALGORITHMS FOR ONLINE PRICING
cites work: Online pricing for bundles of multiple items
DOI: 10.1016/J.TCS.2015.05.034
description: scientific article; zbMATH DE number 6517486