Skip to main content
Log in

The First International Trading Agent Competition: Autonomous Bidding Agents

  • Published:
Electronic Commerce Research Aims and scope Submit manuscript

Abstract

This article summarizes the bidding algorithms developed for the on-line Trading Agent Competition held in July, 2000 in Boston. At its heart, the article describes 12 of the 22 agent strategies in terms of (i) bidding strategy, (ii) allocation strategy, (iii) special approaches, and (iv) team motivations. The common and distinctive features of these agent strategies are highlighted. In addition, experimental results are presented that give some insights as to why the top-scoring agents’ strategies were most effective.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Boman, M. (1999). “Norms in Artificial Decision Making.” Artificial Intelligence and Law 7, 17–35.

    Google Scholar 

  2. Boutilier, C., M. Goldszmidt, and B. Sabata. (1999). “Sequential Auctions for the Allocation of Resources with Complementarities.” In Proceedings of 16th International Joint Conference on Artificial Intelligence, vol. 1, pp. 478–485.

    Google Scholar 

  3. Boyan, J.A. Greenwald, R.M. Kirby, and J. Reiter. (2001). “Bidding Algorithms for Simultaneous Auctions.” In Proceedings of IJCAI Workshop on Economic Agents, Models, and Mechanisms, pp. 1–11.

  4. Cliff, D. and J. Bruten. (1997). “Zero is Not Enough: On the Lower Limit of Agent Intelligence for Continuous Double Auction Markets.” HP Technical Report HPL-97–141.

  5. Ekenberg, L., M. Boman, and J. Linneroth-Bayer. (2001). “General Risk Constraints.” Journal of Risk Research 4(1), 31–47.

    Google Scholar 

  6. Greenwald, A. and J. Boyan. (2001). “Bidding Algorithms for Simultaneous Auctions: A Case Study.” In Proceedings of Third ACM Conference on Electronic Commerce, pp. 115–124.

  7. Roth, A. and A. Ockenfels. (2000). “Late Minute Bidding and the Rules for Ending Second-Price Auctions: Theory and Evidence from a Natural Experiment on the Internet.” Working Paper, Harvard University.

  8. Rothkopf, M.H., A. Pekeč, and R.M. Harstad. (1998). “Computationally Manageable Combinatorial Auctions.” Management Science 44(8).

  9. Russell, S. and P. Norvig. (1995). Artificial Intelligence: A Modern Approach. Prentice-Hall.

  10. Simon, H. (1958). “Rational Choice and the Structure of the Environment.” In Models of Bounded Rationality, vol. 2. Cambridge: MIT Press.

    Google Scholar 

  11. Stone, P. (2000). Layered Learning in Multiagent Systems: A Winning Approach to Robotic Soccer. MIT Press.

  12. Stone, P., M.L. Littman, S. Singh, and M. Kearns. (2001). “ATTac-2000: An Adaptive Autonomous Bidding Agent.” In Fifth International Conference on Autonomous Agents.

  13. Wellman, M.P., P.R. Wurman, K. O’Malley, R. Bangera, S.-d. Lin, D. Reeves, and W. E. Walsh. (2001). “A Trading Agent Competition.” IEEE Internet Computing.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Stone.

Additional information

This article is the result of the efforts of many people. The agent descriptions were originally written by team members as listed in Table 1 and the Appendix.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stone, P., Greenwald, A. The First International Trading Agent Competition: Autonomous Bidding Agents. Electron Commerce Res 5, 229–265 (2005). https://doi.org/10.1007/s10660-005-6158-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10660-005-6158-z

Keywords

Navigation