A novel auction mechanism for selling time-sensitive e-services

被引：25

作者：

Lee, JS ^{[1
]}

Szymanski, BK ^{[1
]}

机构：

[1] Optimaret Inc, Troy, NY 12180 USA

来源：

CEC 2005: Seventh IEEE International Conference on E-Commerce Technology, Proceedings | 2005年

关键词：

D O I：

10.1109/ICECT.2005.7

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Many e-services are time-sensitive as the users request them for a specific time period. Such services need to be repeatedly offered to keep them constantly utilized This paper studies winner selection strategies in a recurring auction for such time-sensitive e-services. We observe that because of uneven wealth distribution, the least wealthy bidders tend to drop out of recurring auction as they persistently loose. The bidders dropping out of an auction decrease competition and can cause a collapse of winning prices. We propose and evaluate a novel auction mechanism that enables bidder drop control. Compared to traditional auction mechanisms, ours increases revenue of the e-service provider and decreases loss of fairness of the e-service allocation.

引用

页码：75 / 82

页数：8