文章基本信息

标题：An Average-case Budget-Non-Negative Double Auction Protocol
本地全文：下载
作者：Yuko Sakurai ; Makoto Yokoo
期刊名称：人工知能学会論文誌
印刷版ISSN：1346-0714
电子版ISSN：1346-8030
出版年度：2003
卷号：18
期号：1
页码：15-23
DOI：10.1527/tjsai.18.15
出版社：The Japanese Society for Artificial Intelligence
摘要：We develop a new strategy-proof double auction protocol characterized as average-case budget-non-negative. It is well-known that there is no strategy-proof double auction protocol that satisfies Pareto efficiency, individual rationality, and budget-balance simultaneously. The existing approach is to give up Pareto efficiency or strategy-proofness by enforcing budget-balance or budget-positive as a hard constraint. We propose a new direction to relax the budget-non-negative condition slightly. Although this protocol might take loss or profit for some cases, it it guaranteed not to exceed the predetermined amount of loss. Simulation results show that this protocol can be budget-non-negative on average and achieve social surplus that is very close to being Pareto efficient by setting parameters appropriately.
关键词：Electronic Commerce ; Internet auction ; Mechanism design