Abstract
We examine several issues associated with the design of agents trading in e-marketplaces. We use an adaptive, robust agent architecture combining principled methods and empirical knowledge. The agent needs to solve an optimization problem in order to maximize its gain. Deciding the optimal quantities to buy and sell is only part of the problem. The desired prices and the time of bid placement is also important. Bid aggressiveness must be balanced against the cost of obtaining increased flexibility.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
P. Anthony, W. Hall, V. Dang, and N. R. Jennings. Autonomous agents for participating in multiple on-line auctions. In IJCAI Workshop on E-Business and Intelligent Web, 2001.
Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions. In Proc of IJCAI-99, pages 548–553, Aug. 1999.
A. Greenwald and P. Stone. Autonomous bidding agents in the trading agent competition. IEEE Internet Computing, April, March/April 2001.
A. R. Greenwald and J. Boyan. Bid determination for simultaneous auctions. In Proc of the 3rd ACM Conference on Electronic Commerce, pages 115–124 and 210-212, Oct. 2001.
A. R. Greenwald, J. O. Kephart, and G. J. Tesauro. Strategic pricebot dynamics. In Proceedings of the ACM Conference on Electronic Commerce (EC-99), Nov. 1999.
P. Klemperer. Auction theory: A guide to the literature. Journal of Economic Surveys Vol13(3), July 1999.
C. Preist, C. Bartolini, and I. Phillips. Algorithm design for agents which participate in multiple simultaneous auctions. In Agent Mediated Electronic Commerce III (LNAI), Springer-Verlag, Berlin, pages 139–154, 2001.
T. Sandholm and S. Suri. Improved algorithms for optimal winner determination in combinatorial auctions. In Proc 7th Conference on Artificial Intelligence (AAAI-00), July 2000.
P. Stone, M. L. Littman, S. Singh, and M. Kearns. ATTac-2000: an adaptive autonomous bidding agent. In Proc 5th International Conference on Autonomous Agents, May 2001.
M. P. Wellman, P. R. Wurman, K. O’Malley, R. Bangera, S. de Lin, D. Reeves, and W. E. Walsh. Designing the market game for tac. IEEE Internet Computing, March/April 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vetsikas, I.A. (2002). Design Tradeoffs for Autonomous Trading Agents. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_83
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive