QQ客服 官方微博 反馈留言

	Competitive algorithms for online pricing
	Zhang Yong; Francis Y. L.; Chin Hing-Fung Ting
	2011
会议名称	17th Annual International Computing and Combinatorics Conference
会议地点	Dallas
英文摘要	Given a seller with m amount of items, a sequence of users {u1, u2, ...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi (·) such that vi (x) is the highest unit price ui is willing to pay for x items. The objective is to maximize the revenue by setting the price and amount of items for each user. In this paper, we have the following contributions: if the highest value h among all vi (x) is known in advance, we first show the lower bound of the competitive ratio is O(logh), then give an online algorithm with competitive ratio O(logh); if h is not known in advance, we give an online algorithm with competitive ratio O(h3log-1/2h). © 2011 Springer-Verlag.(11 refs)
收录类别	EI
语种	英语
内容类型	会议论文
源URL	[http://ir.siat.ac.cn:8080/handle/172644/3577]
专题	深圳先进技术研究院_数字所
作者单位	2011
推荐引用方式 GB/T 7714	Zhang Yong,Francis Y. L.,Chin Hing-Fung Ting. Competitive algorithms for online pricing[C]. 见:17th Annual International Computing and Combinatorics Conference. Dallas.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。