Abstract
Although combinatorial auction has been studied extensively, it is difficult to apply the existing results to a problem with minimal resource requirements. In this paper, we consider a combinatorial auction problem in which an auctioneer wants to acquire resources from a set of bidders to process the tasks on hand. Each task requires a minimal set of resources for executing the operations. Each bidder owns a set of resources to bid for the tasks. The problem is to determine the resource assignment to minimize the total cost to perform the tasks. The main results include: (1) a problem formulation for combinatorial auction with minimal resource requirements; (2) a solution methodology based on Lagrangian relaxation; (3) an economic interpretation and a proposed structure for implementing our solution algorithms.
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
Preview
Unable to display preview. Download preview PDF.
References
de Vries, S., Vohra, R.V.: Combinatorial Auctions: A Survey. INFORMS Journal on Computing 3, 284–309 (2003)
Guo, Y., Lim, A., Rodrigues, B., Tang, J.: Using a Lagrangian heuristic for a combinatorial auction proble. In: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence, IEEE Computer Society Press, Los Alamitos (2005)
de Vries, S., Vohra, R.V.: Combinatorial Auctions: A Survey. INFORMS Journal on Computing 15(3), 284–309 (2003)
Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 39–46 (2000)
Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions:Optimal and approximate approaches. In: Sixteenth International Joint Conference on Artificial Intelligence, pp. 548–553 (1999)
Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 22–29 (2000)
Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2), 1–54 (2002)
Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABOB: A fast optimal algorithm for combinatorial auctions. In: IJCAI, pp. 1102–1108 (2001)
Polyak, B.T.: Minimization of Unsmooth Functionals. USSR Computational Math. and Math. Physics 9, 14–29 (1969)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hsieh, FS. (2007). Combinatorial Auction with Minimal Resource Requirements. In: Okuno, H.G., Ali, M. (eds) New Trends in Applied Artificial Intelligence. IEA/AIE 2007. Lecture Notes in Computer Science(), vol 4570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73325-6_107
Download citation
DOI: https://doi.org/10.1007/978-3-540-73325-6_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73322-5
Online ISBN: 978-3-540-73325-6
eBook Packages: Computer ScienceComputer Science (R0)