Competitive algorithms for unbounded one-way trading

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...

Full description

Bibliographic Details

Main Authors:	Francis Y.L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei Zhou
Format:	Default Article
Published:	2015
Subjects:	Other mathematical sciences not elsewhere classified untagged Mathematical Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/18233
Tags:	Add Tag No Tags, Be the first to tag this record!