Abstract
During the past few years, auctions have become popular in conducting trade negotiations on the Internet. The design of new auctions and other negotiation protocols has become an important topic for both, industry and academia. Traditional auction mechanisms allow price-only negotiations for which the winner determination is a computationally simple task. However, the need for new auction mechanisms that allow complex bids such as bundle bids and multi-attribute bids has been raised in many situations. The winner determination in these auctions is a computationally hard problem. The computational complexity has been a significant hurdle for the widespread use of these advanced auction models. In this paper, we will outline the auction design space and classify resource allocation algorithms along multiple dimensions. Then, we will explain the design of an object framework providing an API to different types of winner determination algorithms. This framework enables application programmers to specify buyer preferences, allocation rules and supplier offerings in a declarative manner, and solve the allocation problems without having to re-implement the computationally complex algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Wolfstetter, “Auctions: An Introduction,” Journal of Economic Surveys, vol. 10, pp. 367–420, 1996.
M. Bichler, J. Kalagnanam, K. K. Katircioglu, A. J. King, R. D. Lawrence, H. S. Lee, G. Y. Lin, and Y. Lu, “Applications of Flexible Pricing in Business-to-Business Electronic Commerce,” IBM Systems Journal, 2002.
M. Eso, “Evaluation algorithms in auctions,” IBM T.J. Watson Research Center, Yorktown Heights, Working Paper 2001.
A. Davenport and J. Kalagnanam, “Price Negotiations for Procurement of Direct Inputs,” IMA “Hot Topics” Workshop: Mathematics of the Internet: E-Auction and Markets, Minneapolis, USA, Workshop Report December 3–5, 2000 2000.
M. H. Rothkopf and A. Pekec, “Computationally Manageable Combinatorial Auctions,” presented at Maryland Auction Conference, Maryland, USA, 1998.
T. Sandholm, “Approaches to winner determination in combinatorial auctions,” Decision Support Systems, vol. 28, pp. 165–176, 1999.
G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, Optimization. Amsterdam: Elsevier, 1989.
M. Bichler, The Future of eMarkets: Multi-Dimensional Market Mechanisms. Cambridge, UK: Cambridge University Press, 2001.
D. L. Olson, Decision Aids for Selection Problems. New York, et al.: Springer, 1995.
M. Bichler, J. Kalagnanam, and H. S. Lee, “ECCO—Automated Evaluation of Configurable Offerings,” IBM Research, Yorktown Heights, Research Report 2002.
C. Boutilier and H. H. Hoos, “Bidding Languages for Combinatorial Auctions,” presented at 17th International Joint Conference on Artificial Intelligence (IJCAI) 2001, Washington, USA, 2001.
D. Reeves, B. Grosof, and M. Wellman, “Automated Negotiations from Declarative Contract Descriptions,” presented at AAAI-2000 Workshop on Knowledge-Based Electronic Markets, Austin, TX, 2000.
M. Bichler, J. Lee, C. H. Kim, and H. S. Lee, “Design and Implementation of an Intelligent Decision Analysis System for E-Sourcing,” presented at International Conference on Artificial Intelligence 2001, Las Vegas, NV, 2001.
V. S. Iyengar, J. Lee, and M. Campbell, “Q-Eval: Evaluating Multiple Attribute Items Using Queries,” IBM Research, New York, Research Report 2001.
J. Sametinger, Software Engineering with Reusable Components. New York: Springer, 1997.
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
Bichler, M., Kalagnanam, J., Lee, H.S., Lee, J. (2002). Winner Determination Algorithms for Electronic Auctions: A Framework Design. In: Bauknecht, K., Tjoa, A.M., Quirchmayr, G. (eds) E-Commerce and Web Technologies. EC-Web 2002. Lecture Notes in Computer Science, vol 2455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45705-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-45705-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44137-3
Online ISBN: 978-3-540-45705-3
eBook Packages: Springer Book Archive