Robust double auction protocol against false-name bids

Internet auctions have become an integral part of electronic commerce (EC) and a promising field for applying agent technologies. Although the Internet provides an excellent infrastructure for large-scale auctions, we must consider the possibility of a new type of cheating, i.e., a bidder trying to profit from submitting several bids under fictitious names (false-name bids). Double auctions are an important subclass of auction protocols that permit multiple buyers and sellers to bid to exchange a good, and have been widely used in stock, bond, and foreign exchange markets. If there exists no false-name bid, a double auction protocol called PMD protocol has proven to be dominant-strategy incentive compatible. On the other hand, if we consider the possibility of false-name bids, the PMD protocol is no longer dominant-strategy incentive compatible. We develop a new double auction protocol called the Threshold Price Double auction (TPD) protocol, which is dominant strategy incentive compatible even if participants can submit false-name bids. The characteristics of the TPD protocol is that the number of trades and prices of exchange are controlled by the threshold price. Simulation results show that this protocol can achieve a social surplus that is very close to being Pareto efficient.

[1]  T. Sandholm Limitations of the Vickrey Auction in Computational Multiagent Systems , 1996 .

[2]  Makoto Yokoo,et al.  A Limitation of the Generalized Vickrey Auction in Electronic Commerce: Robustness against False-name Bids , 1999, AAAI/IAAI.

[3]  Eric Bennett Rasmusen Readings in games and information , 2001 .

[4]  Makoto Yokoo,et al.  Robust Combinatorial Auction Protocol against False-Name Bids , 2000, AAAI/IAAI.

[5]  Makoto Yokoo,et al.  The effect of false-name declarations in mechanism design: towards collective decision making on the Internet , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[6]  Hal R. Varian,et al.  Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.

[7]  櫻井 祐子,et al.  Hal R. Varian: Economic Mechanism Design for Computerized Agents, the First Usenix Workshop on Electronic Commercr (1995). , 2000 .

[8]  Ilya Segal,et al.  Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .

[9]  R. McAfee,et al.  A dominant strategy double auction , 1992 .

[10]  M. Satterthwaite,et al.  Efficient Mechanisms for Bilateral Trading , 1983 .

[11]  Michael P. Wellman,et al.  The Michigan Internet AuctionBot: a configurable auction server for human and software agents , 1998, AGENTS '98.

[12]  Pattie Maes,et al.  Agent-mediated electronic commerce: a survey , 1998, The Knowledge Engineering Review.

[13]  P. Klemperer Auction Theory: A Guide to the Literature , 1999 .

[14]  Michael P. Wellman,et al.  Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..

[15]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .