Bidding Heuristics for Simultaneous Auctions: Lessons from TAC Travel

We undertake an experimental study of heuristics designed for the Travel division of the Trading Agent Competition. Our primary goal is to analyze the performance of the sample average approximation (SAA) heuristic, which is approximately optimal in the decision-theoretic (DT) setting, in this game-theoretic (GT) setting. To this end, we conduct experiments in four settings, three DT and one GT. The relevant distinction between the DT and the GT settings is: in the DT settings, agents’ strategies do not affect the distribution of prices. Because of this distinction, the DT experiments are easier to analyze than the GT experiments. Moreover, settings with normally distributed prices, and controlled noise, are easier to analyze than those with competitive equilibrium prices. In the studied domain, analysis of the DT settings with possibly noisy normally distributed prices informs our analysis of the richer DT and GT settings with competitive equilibrium prices. In future work, we plan to investigate whether this experimental methodology—namely, transferring knowledge gained in a DT setting with noisy signals to a GT setting—can be applied to analyze heuristics for playing other complex games.

[1]  Michael Luck,et al.  AAMAS '03: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems , 2003 .

[2]  Nicholas R. Jennings,et al.  Decision procedures for multiple auctions , 2002, AAMAS '02.

[3]  Amy Greenwald,et al.  Bidding Algorithms for Simultaneous Auctions: A Case Study , 2005 .

[4]  Bart Selman,et al.  A principled study of the design tradeoffs for autonomous trading agents , 2003, AAMAS '03.

[5]  Shou-De Lin,et al.  A trading agent competition , 2000 .

[6]  R. Rosenthal,et al.  Simultaneous Auctions with Synergies , 1996 .

[7]  Michael P. Wellman,et al.  Walverine: a Walrasian trading agent , 2003, AAMAS '03.

[8]  Michael Rovatsos,et al.  Capturing agent autonomy in roles and XML , 2003, AAMAS '03.

[9]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

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

[11]  A. Shapiro,et al.  The Sample Average Approximation Method for Stochastic Programs with Integer Recourse , 2002 .

[12]  Pericles A. Mitkas,et al.  Mertacor: a successful autonomous trading agent , 2006, AAMAS '06.

[13]  Nicholas R. Jennings,et al.  Optimal Bidding Strategies for Simultaneous Vickrey Auctions with Perfect Substitutes , 2006, Negotiation and Market Engineering.

[14]  Shou-De Lin,et al.  Designing the Market Game for a Trading Agent Competition , 2001, IEEE Internet Comput..

[15]  Nicholas R. Jennings,et al.  SouthamptonTAC: An adaptive autonomous trading agent , 2003, TOIT.

[16]  Norman M. Sadeh,et al.  The supply chain trading agent competition , 2005, Electron. Commer. Res. Appl..

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

[18]  Amy Greenwald,et al.  Bidding under Uncertainty: Theory and Experiments , 2004, UAI.

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

[20]  Victor Naroditskiy,et al.  RoxyBot-06: An (SAA)2 TAC Travel Agent , 2007, IJCAI.

[21]  J. Wyatt Decision support systems. , 2000, Journal of the Royal Society of Medicine.

[22]  Michael P. Wellman,et al.  Empirical game-theoretic analysis of the TAC Supply Chain game , 2007, AAMAS '07.

[23]  Bart Selman,et al.  Bayes-Nash equilibria for mth price auctions with multiple closing times , 2007, SECO.