Adaptive Auction Mechanism Design and the Incorporation of Prior Knowledge

Electronic auction markets are economic information systems that facilitate transactions between buyers and sellers. Whereas auction design has traditionally been an analytic process that relies on theory-driven assumptions such as bidders' rationality, bidders often exhibit unknown and variable behaviors. In this paper we present a data-driven adaptive auction mechanism that capitalizes on key properties of electronic auction markets, such as the large transaction volume, access to information, and the ability to dynamically alter the mechanism's design to acquire information about the benefits from different designs and adapt the auction mechanism online in response to actual bidders' behaviors. Our auction mechanism does not require an explicit representation of bidder behavior to infer about design profitability---a key limitation of prior approaches when they address complex auction settings. Our adaptive mechanism can also incorporate prior general knowledge of bidder behavior to enhance the search for effective designs. The data-driven adaptation and the capacity to use prior knowledge render our mechanisms particularly useful when there is uncertainty regarding bidders' behaviors or when bidders' behaviors change over time. Extensive empirical evaluations demonstrate that the adaptive mechanism outperforms any single fixed mechanism design under a variety of settings, including when bidders' strategies evolve in response to the seller's adaptation; our mechanism's performance is also more robust than that of alternatives when prior general information about bidders' behaviors differs from the encountered behaviors.

[1]  R. Weber Making More from Less: Strategic Demand Reduction in the FCC Spectrum Auctions , 1997 .

[2]  Foster J. Provost,et al.  Active Sampling for Class Probability Estimation and Ranking , 2004, Machine Learning.

[3]  Robert Zeithammer Forward-Looking Bidding in Online Auctions , 2005 .

[4]  Terence C. Mills,et al.  Time series techniques for economists , 1990 .

[5]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[6]  Alok Gupta,et al.  Analysis and Design of Business - to - Consumer Online Auctions , 2003, Manag. Sci..

[7]  Avrim Blum,et al.  Near-optimal online auctions , 2005, SODA '05.

[8]  Michael Peters,et al.  Competition among Sellers Who Offer Auctions Instead of Prices , 1997 .

[9]  Wolfgang Jank,et al.  Exploring auction databases through interactive visualization , 2006 .

[10]  Victor Ginsburgh,et al.  On organizing a sequential auction: results from a natural experiment by Christie's , 2006 .

[11]  David C. Parkes,et al.  The sequential auction problem on eBay: an empirical analysis and a solution , 2006, EC '06.

[12]  P. Cramton The FCC Spectrum Auctions: An Early Assessment , 1997 .

[13]  Lisa N. Takeyama,et al.  Buy prices in online auctions: irrationality on the internet? , 2001 .

[14]  A. Roth,et al.  Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet , 2002 .

[15]  Michael Peters,et al.  A Competitive Distribution of Auctions , 1997 .

[16]  David C. Parkes,et al.  Iterative combinatorial auctions: achieving economic and computational efficiency , 2001 .

[17]  Dave Cliff,et al.  Evolution of market mechanism through a continuous space of auction-types , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[18]  Richard S. Sutton,et al.  Introduction to Reinforcement Learning , 1998 .

[19]  Peter Stone,et al.  Adaptive mechanism design: a metalearning approach , 2006, ICEC '06.

[20]  U. Dholakia,et al.  The Effect of Explicit Reference Points on Consumer Choice and Online Bidding Behavior , 2005 .

[21]  D. Ariely,et al.  Buying, Bidding, Playing, or Competing? Value Assessment and Decision Dynamics in Online Auctions , 2003 .

[22]  Andrew Byde,et al.  Applying evolutionary game theory to auction mechanism design , 2003, EEE International Conference on E-Commerce, 2003. CEC 2003..

[23]  Thomas D. Jeitschko,et al.  Learning in Sequential Auctions , 1997 .

[24]  GoesPaulo,et al.  User heterogeneity and its impact on electronic auction market design , 2004 .

[25]  Sarit Kraus,et al.  Learning Environmental Parameters for the Design of Optimal English Auctions with Discrete Bid Levels , 2005, AMEC@AAMAS/TADA@IJCAI.

[26]  Wolfgang Jank,et al.  Price formation and its dynamics in online auctions , 2008, Decis. Support Syst..

[27]  Andrew W. Moore,et al.  Locally Weighted Learning , 1997, Artificial Intelligence Review.

[28]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[29]  Jerome H. Friedman,et al.  On Bias, Variance, 0/1—Loss, and the Curse-of-Dimensionality , 2004, Data Mining and Knowledge Discovery.

[30]  H. Robbins Some aspects of the sequential design of experiments , 1952 .

[31]  Risto Miikkulainen,et al.  Evolving Neural Networks through Augmenting Topologies , 2002, Evolutionary Computation.

[32]  James C. Spall,et al.  AN OVERVIEW OF THE SIMULTANEOUS PERTURBATION METHOD FOR EFFICIENT OPTIMIZATION , 1998 .

[33]  Alok Gupta,et al.  Predicting Bidders' Willingness to Pay in Online Multiunit Ascending Auctions: Analytical and Empirical Insights , 2008, INFORMS J. Comput..

[34]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[35]  Bernard J. Jansen,et al.  Sponsored search: an overview of the concept, history, and technology , 2008, Int. J. Electron. Bus..

[36]  Vijay Kumar,et al.  Online learning in online auctions , 2003, SODA '03.

[37]  G. Ainslie Picoeconomics: The Strategic Interaction of Successive Motivational States within the Person , 1992 .

[38]  Ronald M. Harstad,et al.  Modeling Competitive Bidding: A Critical Essay , 1994 .

[39]  R. McAfee Mechanism Design by Competing Sellers , 1993 .