Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/18233

Title: Competitive algorithms for unbounded one-way trading
Authors: Chin, Francis Y.L.
Fu, Bin
Guo, Jiuling
Han, Shuguang
Hu, Jueliang
Jiang, Minghui
Lin, Guohui
Ting, Hing-Fung
Zhang, Luping
Zhang, Yong
Zhou, Diwei
Issue Date: 2015
Publisher: © Elsevier
Citation: CHIN, F.Y.L. ... et al, 2015. Competitive algorithms for unbounded one-way trading. Theoretical Computer Science, 607(Pt.1), pp.35-48.
Abstract: In the one-way trading problem, a seller has L units of product to be sold to a sequence σ of buyers u1,u2,…,uσu1,u2,…,uσ arriving online and he needs to decide, for each ui, the amount of product to be sold to ui at the then-prevailing market price pi. The objective is to maximize the seller's revenue. We note that all previous algorithms for the problem need to impose some artificial upper bound M and lower bound m on the market prices, and the seller needs to know either the values of M and m , or their ratio M/mM/m, at the outset....[cont'd]
Description: This paper was accepted for publication in the journal Theoretical Computer Science and the definitive published version is available at http://dx.doi.org/10.1016/j.tcs.2015.05.034.
Sponsor: This work is supported by NSFC (61433012, U1435215, 11171086), Natural Science Foundation of Hebei Province A2013201218, HK RGC grant HKU-711709E, HK RGC grant HKU-716412E.
Version: Accepted for publication
DOI: 10.1016/j.tcs.2015.05.034
URI: https://dspace.lboro.ac.uk/2134/18233
Publisher Link: http://dx.doi.org/10.1016/j.tcs.2015.05.034
ISSN: 0304-3975
Appears in Collections:Published Articles (Maths)

Files associated with this item:

File Description SizeFormat
onewaytrading.pdfAccepted version161.34 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.