Online pricing for multi-type of items
文献类型：会议论文
| 作者 | Zhang yong; Chin Francis Y.L.; Ting hing-fung |
| 出版日期 | 2012 |
| 会议名称 | 6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012 |
| 会议地点 | Beijing |
| 英文摘要 | In this paper, we study the problem of online pricing for bundles of items. Given a seller with k types of items, m of each, a sequence of users {u 1, u 2, ...} arrives one by one. Each user is single-minded, i.e., each user is interested only in a particular bundle of items. The seller must set the price and assign some amount ofbundles to each user upon his/her arrival. Bundles can be sold fractionally. Each u i has his/her value function v i (·) such that v i (x) is the highest unit price u i is willing to pay for x bundles. The objective is to maximize the revenue of the seller by setting the price and amount of bundles for each user. In this paper, we first show that the lower bound of the competitive ratio for this problem is Ω(logh + logk), where h is the highest unit price to be paid among all users. We then give a deterministic online algorithm, Pricing, whose competitive ratio is O (√k·log h log k). When k = 1 the lower and upper bounds asymptotically match the optimal result O(logh). © 2012 Springer-Verlag.(15 refs) |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/4218]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2012 |
| 推荐引用方式 GB/T 7714 | Zhang yong,Chin Francis Y.L.,Ting hing-fung. Online pricing for multi-type of items[C]. 见:6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012. Beijing. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。