onewaytrading.pdf (161.34 kB)
Competitive algorithms for unbounded one-way trading
journal contribution
posted on 2015-07-10, 15:27 authored by Francis Y.L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei ZhouDiwei ZhouIn 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]
Funding
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.
History
School
- Science
Department
- Mathematical Sciences
Published in
Theoretical Computer ScienceVolume
607Issue
Part 1Pages
35 - 48Citation
CHIN, F.Y.L. ... et al, 2015. Competitive algorithms for unbounded one-way trading. Theoretical Computer Science, 607(Pt.1), pp.35-48.Publisher
© ElsevierVersion
- AM (Accepted Manuscript)
Publisher statement
This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/Acceptance date
2015-05-22Publication date
2015-05-28Notes
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.ISSN
0304-3975Publisher version
Language
- en