# American Institute of Mathematical Sciences

• Previous Article
A survey: Reward distribution mechanisms and withholding attacks in Bitcoin pool mining
• MFC Home
• This Issue
• Next Article
Relay selection based on social relationship prediction and information leakage reduction for mobile social networks
November  2018, 1(4): 383-392. doi: 10.3934/mfc.2018019

## Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate

 1 Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, China 2 Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong 3 School of Computer Science and Technology, University of Science and Technology of China, China

Received  September 2018 Revised  September 2018 Published  December 2018

In the one-way trading problem, a seller has some product to be sold to a sequence of buyers in an online fashion, i.e., buyers come one after another. Each buyer has the accepted unit price which is known to the seller on his arrival. To maximize the total revenue, the seller has to carefully decide the amount of products to be sold to each buyer at the then-prevailing prices. In this paper, we study the unbounded one-way trading, i.e., the highest unit price among all buyers is positive and unbounded. We assume that the highest prices of buyers follow some distribution with monotone hazard rate, which is a well-adopted assumption. We investigate two variants, (1) the distribution is on the highest price among all buyers, and (2) the distribution of the highest price of each buyer is independent and identically distributed. To measure the performance of the algorithms, the expected competitive ratios, $\mathrm{E}[OPT]/\mathrm{E}[ALG]$ and $\mathrm{E}[OPT/ALG]$, are considered. If the distributions satisfy the monotone hazard rate, for both of the above two variants, constant-competitive algorithms can be achieved.

Citation: Yong Zhang, Francis Y. L. Chin, Francis C. M. Lau, Haisheng Tan, Hing-Fung Ting. Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate. Mathematical Foundations of Computing, 2018, 1 (4) : 383-392. doi: 10.3934/mfc.2018019
##### References:

show all references

##### References:
 [1] C. Xiong, J.P. Miller, F. Gao, Y. Yan, J.C. Morris. Testing increasing hazard rate for the progression time of dementia. Discrete & Continuous Dynamical Systems - B, 2004, 4 (3) : 813-821. doi: 10.3934/dcdsb.2004.4.813 [2] Jiping Tao, Ronghuan Huang, Tundong Liu. A $2.28$-competitive algorithm for online scheduling on identical machines. Journal of Industrial & Management Optimization, 2015, 11 (1) : 185-198. doi: 10.3934/jimo.2015.11.185 [3] Lili Ding, Xinmin Liu, Yinfeng Xu. Competitive risk management for online Bahncard problem. Journal of Industrial & Management Optimization, 2010, 6 (1) : 1-14. doi: 10.3934/jimo.2010.6.1 [4] Jiping Tao, Zhijun Chao, Yugeng Xi. A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times. Journal of Industrial & Management Optimization, 2010, 6 (2) : 269-282. doi: 10.3934/jimo.2010.6.269 [5] Ran Ma, Jiping Tao. An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time. Journal of Industrial & Management Optimization, 2018, 14 (2) : 497-510. doi: 10.3934/jimo.2017057 [6] Kevin Kuo, Phong Luu, Duy Nguyen, Eric Perkerson, Katherine Thompson, Qing Zhang. Pairs trading: An optimal selling rule. Mathematical Control & Related Fields, 2015, 5 (3) : 489-499. doi: 10.3934/mcrf.2015.5.489 [7] Ying Li, Miyuan Shan, Michael Z.F. Li. Advance selling decisions with overconfident consumers. Journal of Industrial & Management Optimization, 2016, 12 (3) : 891-905. doi: 10.3934/jimo.2016.12.891 [8] Charles S. Tapiero, Pierre Vallois. Implied fractional hazard rates and default risk distributions. Probability, Uncertainty and Quantitative Risk, 2017, 2 (0) : 2-. doi: 10.1186/s41546-017-0015-6 [9] Taofeng Ye, Yan Zhao. Quality choice and capacity rationing in advance selling. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020107 [10] Miguel Atencia, Esther García-Garaluz, Gonzalo Joya. The ratio of hidden HIV infection in Cuba. Mathematical Biosciences & Engineering, 2013, 10 (4) : 959-977. doi: 10.3934/mbe.2013.10.959 [11] Ning Zhang, Qiang Wu. Online learning for supervised dimension reduction. Mathematical Foundations of Computing, 2019, 2 (2) : 95-106. doi: 10.3934/mfc.2019008 [12] Jingming Pan, Wenqing Shi, Xiaowo Tang. Pricing and ordering strategies of supply chain with selling gift cards. Journal of Industrial & Management Optimization, 2018, 14 (1) : 349-369. doi: 10.3934/jimo.2017050 [13] Shuren Liu, Qiying Hu, Yifan Xu. Optimal inventory control with fixed ordering cost for selling by internet auctions. Journal of Industrial & Management Optimization, 2012, 8 (1) : 19-40. doi: 10.3934/jimo.2012.8.19 [14] Jumpei Inoue, Kousuke Kuto. On the unboundedness of the ratio of species and resources for the diffusive logistic equation. Discrete & Continuous Dynamical Systems - B, 2020  doi: 10.3934/dcdsb.2020186 [15] Martin Fraas, David Krejčiřík, Yehuda Pinchover. On some strong ratio limit theorems for heat kernels. Discrete & Continuous Dynamical Systems - A, 2010, 28 (2) : 495-509. doi: 10.3934/dcds.2010.28.495 [16] Joon Kwon, Panayotis Mertikopoulos. A continuous-time approach to online optimization. Journal of Dynamics & Games, 2017, 4 (2) : 125-148. doi: 10.3934/jdg.2017008 [17] Shuhua Wang, Zhenlong Chen, Baohuai Sheng. Convergence of online pairwise regression learning with quadratic loss. Communications on Pure & Applied Analysis, 2020, 19 (8) : 4023-4054. doi: 10.3934/cpaa.2020178 [18] Ruinian Li, Yinhao Xiao, Cheng Zhang, Tianyi Song, Chunqiang Hu. Cryptographic algorithms for privacy-preserving online applications. Mathematical Foundations of Computing, 2018, 1 (4) : 311-330. doi: 10.3934/mfc.2018015 [19] Robin Cohen, Alan Tsang, Krishna Vaidyanathan, Haotian Zhang. Analyzing opinion dynamics in online social networks. Big Data & Information Analytics, 2016, 1 (4) : 279-298. doi: 10.3934/bdia.2016011 [20] Alan Beggs. Learning in monotone bayesian games. Journal of Dynamics & Games, 2015, 2 (2) : 117-140. doi: 10.3934/jdg.2015.2.117

Impact Factor: