A probabilistic approach to automated bidding in alternative auctions

ABSTRACT

This paper presents an approach to develop bidding agents that participate in multiple alternative auctions, with the goal of obtaining an item at the lowest price. The approach consists of a prediction method and a planning algorithm. The prediction method exploits the history of past auctions in order to build probability functions capturing the belief that a bid of a given price may win a given auction. The planning algorithm computes the lowest price, such that by sequentially bidding in a subset of the relevant auctions, the agent can obtain the item at that price with an acceptable probability. The approach addresses the case where the auctions are for substitutable items with different values. Experimental results are reported, showing that the approach increases the payoff of their users and the welfare of the market.

REFERENCES

• 1: P. Anthony, W. Hall, V. Dang, and N. Jennings. Autonomous agents for participating in multiple online auctions. In Proc. of the IJCAI Workshop on E-Business and the Intelligent Web, Seattle WA, USA, July 2001.
• 2: V. Bansal and R. Garg. On simultaneous online auctions with partial substitutes. Technical report, IBM India Research Lab, November 2000. http://www.research.ibm.com/iac/papers/ri00022.pdf, accessed on 10 Nov. 2001.
• 3: A. Byde. An optimal dynamic programming model for algorithm design in simultaneous auctions. Technical Report HPL-2001-67, HP Labs, Bristol, UK, March 2001. http://www.hpl.hp.com/techreports/2001/HPL-2001-67.html.
• 4: Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
• 5: R. D'Agostino, A. Belanger, and R. D'Agostino Jr. A suggestion for powerful and informative tests of normality. The American Statistician, 44(4):316--321, November 1990.
• 6: Marlon Dumas , Guido Governatori , Arthur ter Hofstede , Nick Russell, An Architecture for Assembling Agents that Participate in Alternative Heterogeneous Auctions, Proceedings of the 12th International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems (RIDE'02), p.75, February 24-25, 2002
• 7: eBay. Proxy bidding. http://www.ebay.com/help/buyerguide/bidding-prxy.html, accessed 10 Nov. 2001.
• 8: P. Garcia, E. Gimenez, L. Godo, and J. Rodriguez-Aguilar. Possibilistic-based design of bidding strategies in electronic auctions. In Proc. of the 13th European Conference on Artificial Intelligence (ECAI), Brighton, UK, 1998. John Wiley and Sons.
• 9: Amy Greenwald , Peter Stone, Autonomous Bidding Agents in the Trading Agent Competition, IEEE Internet Computing, v.5 n.2, p.52-60, March 2001 [doi>10.1109/4236.914648]
• 10: D. Lucking-Reiley. Auctions on the Internet: What's being auctioned, and how? Journal of Industrial Economics, 48(3):227--252, September 2000.
• 11: Chris Preist , Andrew Byde , Claudio Bartolini, Economic dynamics of agents in multiple auctions, Proceedings of the fifth international conference on Autonomous agents, p.545-551, May 2001, Montreal, Quebec, Canada [doi>10.1145/375735.376441]
• 12: Tuomas W. Sandholm, Distributed rational decision making, Multiagent systems: a modern approach to distributed artificial intelligence, MIT Press, Cambridge, MA, 1999
• 13: Ronald A. Thisted, Elements of statistical computing, Chapman & Hall, Ltd., London, UK, 1986
• 14: Gerhard Weiss, Multiagent systems: a modern approach to distributed artificial intelligence, MIT Press, Cambridge, MA, 1999

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.4 INFORMATION SYSTEMS APPLICATIONS
      H.4.m Miscellaneous

Additional Classification:
  J. Computer Applications
  J.m MISCELLANEOUS

General Terms:
Algorithms