Abstract
In a previous work we extended the notion of multi-unit combinatorial reverse auction (MUCRA) by adding a new dimension to the goods at auction. A buyer can express transformability relationships among goods: some goods can be transformed into others at a transformation cost. Through this new auction type, a buyer can find out what goods to buy, to whom, and what transformations to apply to the acquired goods in order to obtain the best savings. The main focus of the paper is to perform some preliminary experiments to quantitatively assess the potential savings that a buying agent may obtain in considering transformation relationships.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4, 63–86 (1998)
Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)
Giovannucci, A., Rodríguez-Aguilar, J.A., Cerquides, J.: Multi-unit combinatorial reverse auctions with transformability relationships among goods. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, Springer, Heidelberg (2005)
Hogg, R.V., Ledolter, J.: Engineering Statistics. Macmillan Publishing Company, Basingstoke (1987)
Holte, R.C.: Combinatorial auctions, knapsack problems, and hill-climbing search. In: Stroulia, E., Matwin, S. (eds.) Advances in Artificial Intelligence. LNCS (LNAI), vol. 2056, Springer, Heidelberg (2001)
Jensen, K.: Coloured Petri Nets, Basic Concepts, Analysis Methods and Practical Use, vol. 1. Monographs in Theoretical Computer Science. An EATCS Series, pp. 78–80. Springer, Heidelberg (1997)
Leyton-Brown, K., Shoham, Y., Tennenholtz, M.: An algorithm for multi-unit combinatorial auctions. In: Proceedings of the AAAI Conference, pp. 56–61 (2000)
Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), 541–580 (1989)
Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinational auctions. Management Science 44(8), 1131–1147 (1998)
Sandholm, T., et al.: Winner determination in combinatorial auction generalizations. In: AAMAS ’02, pp. 69–76. ACM Press, New York (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Giovannucci, A., Cerquides, J., Rodríguez-Aguilar, J.A. (2007). Savings in Combinatorial Auctions Through Transformation Relationships. In: Fasli, M., Shehory, O. (eds) Agent-Mediated Electronic Commerce. Automated Negotiation and Strategy Design for Electronic Markets. TADA AMEC 2006 2006. Lecture Notes in Computer Science(), vol 4452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72502-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-72502-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72501-5
Online ISBN: 978-3-540-72502-2
eBook Packages: Computer ScienceComputer Science (R0)