Skip to main content

ATTac-2001: A Learning, Autonomous Bidding Agent

  • Conference paper
  • First Online:
Agent-Mediated Electronic Commerce IV. Designing Mechanisms and Systems (AMEC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2531))

Included in the following conference series:

Abstract

Auctions are becoming an increasingly popular method for transacting business, especially over the Internet. This paper presents a general approach to building autonomous bidding agents to bid in multiple simultaneous auctions for interacting goods. The core of our approach is learning a model of the empirical price dynamics based on past data and using the model to analytically calculate, to the greatest extent possible, optimal bids. This approach is fully implemented as ATTac-2001, a top-scoring agent in the second Trading Agent Competition (TAC-01). ATTac-2001 uses boosting techniques to learn conditional distributions of auction clearing prices. We present experiments demonstrating the effectiveness of this predictor relative to several reasonable alternatives.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Patricia Anthony, Wendy Hall, Viet Dung Dang, and Nicholas R. Jennings. Autonomous agents for participating in multiple on-line auctions. In Proceedings of the IJCAI-2001 Workshop on E-Business and the Intelligent Web, Seattle, WA, 2001.

    Google Scholar 

  2. Michael Collins, Robert E. Schapire, and Yoram Singer. Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48(1/2/3), 2002.

    Google Scholar 

  3. János A. Csirik, Michael L. Littman, Satinder Singh, and Peter Stone. FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In Ludger Fiege, Gero Mühl, and Uwe Wilhelm, editors, Electronic Commerce: Proceedings of the Second International Workshop, pages 139–151, Heidelberg, Germany, 2001. Springer Verlag.

    Google Scholar 

  4. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119–139, August 1997.

    Article  MATH  MathSciNet  Google Scholar 

  5. Clemens Fritschi and Klaus Dorer. Agent-oriented software engineering for successful TAC participation. In First International Joint Conference on Autonomous Agents and Multi-Agent Systems, Bologna, 2002.

    Google Scholar 

  6. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA, 1979.

    MATH  Google Scholar 

  7. Eduard Gimenez-Funes, Lluis Godo, Juan A. Rodriguez-Aguiolar, and Pere Garcia-Calves. Designing bidding strategies for trading agents in electronic auctions. In Proceedings of the Third International Conference on Multi-Agent Systems, pages 136–143, 1998.

    Google Scholar 

  8. Amy Greenwald and Justing Boyan. Bidding algorithms for simultaneous auctions. In Proceedings of Third ACM Conference on E-Commerce, pages 115–124, Tampa, FL, 2001.

    Google Scholar 

  9. J. Harsanyi. Games with incomplete information played by bayesian players. Management Science, 14:159–182, 320-334, 486-502, 1967–1968.

    MATH  MathSciNet  Google Scholar 

  10. Minghua He and Nicholas R. Jennings. SouthamptonTAC: Designing a successful trading agent. In Fifteenth European Conference on Artificial Intelligence, Lyon, France, 2002.

    Google Scholar 

  11. T. Ito, N. Fukuta, Toramatsu Shintani, and Katia Sycara. Biddingbot: a multiagent support system for cooperative bidding in multiple auctions. In Proceedings of the Fourth International Conference on MultiAgent Systems, pages 399–400, July 2000.

    Google Scholar 

  12. Paul Klemperer. Auction theory: A guide to the literature. Journal of Economic Surveys, 13(3):227–86, July 1999.

    Article  Google Scholar 

  13. Chris Preist, Claudio Bartolini, and Ivan Phillips. Algorithm design for agents which participate in multiple simultaneous auctions. In Agent Mediated Electronic Commerce III (LNAI), pages 139–154. Springer-Verlag, Berlin, 2001.

    Chapter  Google Scholar 

  14. Paul S. A. Reitsma, Peter Stone, János A. Csirik, and Michael L. Littman. Self-enforcing strategic demand reduction. In Agent Mediated Electronic Commerce IV: Designing Mechanisms and Systems, volume 2531 of Lecture Notes in Artificial Intelligence. Springer Verlag, 2002. This volume.

    Google Scholar 

  15. Juan A. Rodriguez-Aguilar, Francisco J. Martin, Pablo Noriega, Pere Garcia, and Carles Sierra. Towards a test-bed for trading agents in electronic auction markets. AI Communications, 11(1):5–19, 1998.

    Article  Google Scholar 

  16. Michael H. Rothkopf and Ronald M. Harstad. Modeling competitive bidding: A critical essay. Management Science, 40(3):364–384, 1994.

    Article  Google Scholar 

  17. Robert E. Schapire and Yoram Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3):297–336, December 1999.

    Article  MATH  Google Scholar 

  18. Robert E. Schapire and Yoram Singer. BoosTexter:A boosting-based system for text categorization. Machine Learning, 39(2/3):135–168, May/June 2000.

    Article  MATH  Google Scholar 

  19. Robert E. Schapire, Peter Stone, David McAllester, Michael L. Littman, and János A. Csirik. Modeling auction price uncertainty using boosting-based conditional density estimation. In Proceedings of the Nineteenth International Conference on Machine Learning, 2002.

    Google Scholar 

  20. Peter Stone and Amy Greenwald. The first international trading agent competition: Autonomous bidding agents. Electronic Commerce Research, 2002. To appear.

    Google Scholar 

  21. Peter Stone, Michael L. Littman, Satinder Singh, and Michael Kearns. ATTac-2000: An adaptive autonomous bidding agent. Journal of Artificial Intelligence Research, 15:189–206, June 2001.

    Google Scholar 

  22. Robert J. Weber. Making more from less: Strategic demand reduction in the FCC spectrum auctions. Journal of Economics and Management Strategy, 6(3):529–548, 1997.

    Article  Google Scholar 

  23. Michael P. Wellman, Amy Greenwald, Peter Stone, and Peter R. Wurman. The 2001 trading agent competition. In Proceedings of the Fourteenth Innovative Applications of Artificial Intelligence Conference, July 2002.

    Google Scholar 

  24. Michael P. Wellman, Peter R. Wurman, Kevin O’Malley, Roshan Bangera, Shou-de Lin, Daniel Reeves, and William E. Walsh. A trading agent competition. IEEE Internet Computing, 5(2):43–51, March/April 2001.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stone, P., Schapire, R.E., Csirik, J.A., Littman, M.L., McAllester, D. (2002). ATTac-2001: A Learning, Autonomous Bidding Agent. In: Padget, J., Shehory, O., Parkes, D., Sadeh, N., Walsh, W.E. (eds) Agent-Mediated Electronic Commerce IV. Designing Mechanisms and Systems. AMEC 2002. Lecture Notes in Computer Science(), vol 2531. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36378-5_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-36378-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00327-4

  • Online ISBN: 978-3-540-36378-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics