计算维克里拍卖中的问题

Issues in Computational Vickrey Auctions

International Journal of Electronic Commerce · 2000
被引 119 · 同刊同年前 8%
ABS 3

中文导读

综述维克里拍卖在计算环境中的局限性,包括收入低、不诚实行为、共谋、隐私泄露及计算复杂性问题,帮助实践者判断何时使用该协议。

Abstract

:The Vickrey auction has been widely advocated for multiagent systems. This protocol has several limitations (lower revenue than with alternative protocols, lying in non-private-value auctions, bidder collusion, lying auctioneers, undesirable revelations of sensitive information), and they are reviewed so as to guide practitioners in deciding when to use it. The special characteristics of Internet auctions are also discussed (third-party auction servers, cryptography, how proxy agents relate to the revelation principle and fail to promote truth telling), as well as several limitations of the protocol that stem from considerations of computational complexity (inefficient allocation and lying in sequential auctions of interrelated items, untruthful bidding under valuation uncertainty, counterspeculation to make deliberation-control or information-gathering decisions). Finally, methods for determining winners and prices in combinatorial"second-price” auctions are treated, together with the implications for truth dominance.

拍卖理论多智能体系统互联网拍卖计算复杂性机制设计