Accounting for price dependencies in simultaneous sealed-bid auctions

Current autonomous bidding strategies for complex auctions typically employ a two phased architecture: first, the agent predicts a distribution over good prices, and then the agent generates bids given those predictions, usually using a heuristic. For computational reasons, previous state-of-the-art methods assumed prices were independent across goods, and then bid based on marginal price distributions. However, prices for goods are typically dependent, especially for complements and substitutes. We examine and bound the potential error from bidding with respect to marginal price distributions when good prices are in fact correlated. Then, to mitigate this error, we develop computationally feasible methods for predicting joint price distributions, and employing such predictions in bidding strategies. We also demonstrate experimentally that the state-of-the-art heuristic for bidding in simultaneous second-price sealed-bid auctions is outdone by the analog of this same heuristic bidding with respect to joint instead of marginal price predictions.

[1]  Michael P. Wellman,et al.  Bidding Strategies for Simultaneous Ascending Auctions , 2008 .

[2]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[3]  John R. Hershey,et al.  Approximating the Kullback Leibler Divergence Between Gaussian Mixture Models , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[4]  Mark M. Bykowsky,et al.  Mutually Destructive Bidding: The FCC Auction Design Problem , 2000 .

[5]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[6]  M. P. Wellman,et al.  Price Prediction in a Trading Agent Competition , 2004, J. Artif. Intell. Res..

[7]  Victor Naroditskiy,et al.  RoxyBot-06: Stochastic Prediction and Optimization in TAC Travel , 2009, J. Artif. Intell. Res..

[8]  H. Akaike A new look at the statistical model identification , 1974 .

[9]  Michael P. Wellman,et al.  Self-confirming price-prediction strategies for simultaneous one-shot auctions , 2012, Games Econ. Behav..

[10]  Michael P. Wellman,et al.  Autonomous bidding agents - strategies and lessons from the trading agent competition , 2007 .

[11]  David A. McAllester,et al.  Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions , 2003, J. Artif. Intell. Res..

[12]  Nicholas R. Jennings,et al.  Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types , 2013, Artif. Intell..

[13]  D. Lehmann,et al.  The Winner Determination Problem , 2003 .

[14]  Norman M. Sadeh,et al.  Pushing the Limits of Rational Agents: The Trading Agent Competition for Supply Chain Management , 2010, AI Mag..

[15]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[16]  Michael P. Wellman,et al.  Exploring bidding strategies for market-based scheduling , 2003, EC '03.

[17]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.