Abstract
In a combinatorial auction, multiple items are for sale simultaneously to a set of buyers. These buyers are allowed to place bids on subsets of the available items. A special kind of combinatorial auction is the so-called matrix bid auction, which was developed by Day (2004). The matrix bid auction imposes restrictions on what a bidder can bid for a subsets of the items. This paper focusses on the winner determination problem, i.e. deciding which bidders should get what items. The winner determination problem of a general combinatorial auction is NP-hard and inapproximable. We discuss the computational complexity of the winner determination problem for a special case of the matrix bid auction. We compare two mathematical programming formulations for the general matrix bid auction winner determination problem. Based on one of these formulations, we develop two branch-and-price algorithms to solve the winner determination problem. Finally, we present computational results for these algorithms and compare them with results from a branch-and-cut approach based on Day and Raghavan (2006).
This research was partially supported by FWO Grant No. G.0114.03.
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
Bleischwitz, Y., Kliewer, G.: Accelerating Vickrey payment computation in combinatorial auctions for an airline alliance. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 228–239. Springer, Heidelberg (2005)
Day, R.W.: Expressing preferences with price-vector agents in combinatorial auctions. PhD thesis, University of Maryland (2004)
Day, R.W., Raghavan, S.: Matrix bidding in combinatorial auctions. Manuscript (2006)
Goossens, D.: Exact methods for combinatorial auctions. PhD thesis, K.U. Leuven (2006)
Goossens, D., Maas, A.J.T., Spieksma, F.C.R., van de Klundert, J.J.: Exact algorithms for procurement problems under a total quantity discount structure. European Journal of Operational Research 178(2), 603–626 (2007)
Grötschel, M.L., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)
Hoos, H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: AAAI/IAAI ’00: Proceedings of the 17th national conference on artificial intelligence and 12th conference on innovative applications of artificial intelligence, Austin, USA, pp. 22–29. AAAI Press/The MIT Press (2000)
Kann, V.: Maximum bounded 3-dimensional matching is max snp-complete. Information Processing Letters 37(1), 27–35 (1991)
Leyton-Brown, K., Shoham, Y., Tennenholtz, M.: An algorithm for multi-unit combinatorial auctions. In: AAAI/IAAI ’00: Proceedings of the 17th national conference on artificial intelligence and 12th conference on innovative applications of artificial intelligence, Austin, USA, pp. 56–61. AAAI Press / The MIT Press, (2000)
Leyton-Brown, K., Nudelman, E., Shoham, Y.: Empirical hardness models for combinatorial auctions. In: Cramton, P., Steinberg, R., Shoham, Y. (eds.) Combinatorial auctions, pp. 479–504. MIT Press, Cambridge (2005)
Leyton-Brown, K., Shoham, Y.: A test suite for combinatorial auctions. In: Cramton, P., Steinberg, R., Shoham, Y. (eds.) Combinatorial auctions, pp. 451–478. MIT Press, Cambridge (2005)
Nisan, N.: Bidding and allocation in combinatorial auctions. In: EC ’00: Proceedings of the 2nd ACM conference on electronic commerce, Minneapolis, USA, pp. 1–12. ACM Press, New York (2000)
Parkes, D.C.: iBundle: an efficient ascending price bundle auction. In: EC ’99: Proceedings of the ACM conference on electronic commerce, Denver, USA, pp. 148–157. ACM Press, New York (1999)
Petrank, E.: The hardness of approximation: gap location. Computational Complexity 4(2), 133–157 (1994)
Rothkopf, M., Pekeç, A., Harstad, R.M.: Computationally manageable combinational auctions. Management Science 44(8), 1131–1147 (1998)
Ryan, D., Foster, B.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer scheduling of public transport: urban passenger vehicle and crew scheduling. North-Holland, pp. 269–280 (1981)
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. Management Science 51, 374–390 (2005)
Vanderbeck, F., Wolsey, L.: An exact algorithm for ip column generation. Operations Research Letters 19, 151–159 (1996)
Van Hoesel, S., Müller, R.: Optimization in electronic markets: examples in combinatorial auctions. Netnomics 3(1), 23–33 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Goossens, D.R., Spieksma, F.C.R. (2007). Exact Algorithms for the Matrix Bid Auction. In: Demetrescu, C. (eds) Experimental Algorithms. WEA 2007. Lecture Notes in Computer Science, vol 4525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72845-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-72845-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72844-3
Online ISBN: 978-3-540-72845-0
eBook Packages: Computer ScienceComputer Science (R0)