Abstract
Single-minded combinatorial auctions (CA) are auctions in which a seller wants to sell diverse kinds of goods and each of the potential buyers, also called bidders, places a bid on a combination, i.e., a subset of the goods. There is a severe computational limitation in CA, as the problem of computing the optimal allocation is NP-hard and even hard to approximate. There is thus interest in polynomial time approximation algorithms for this problem. Recently, many such approximation algorithms were designed, among them greedy and local search based algorithms. One of these is a so-called misdirection algorithm combining both approaches and using a non-standard, misdirected, local search approach with neighborhood of size 2. This algorithm has the best known provable approximation ratio for the problem in terms of the sizes of bids. Its analysis, however, is quite complicated. We study this algorithm and its variants on typical instances designed for CAs. On question is if larger neighborhood helps – the question that seems quite difficult to address theoretically at the moment, taking into account already complex analysis for size 2 neighborhood. We also study experimentally other aspects of the misdirection algorithm, and finally present a comparison to other approximation algorithms.
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
Andersson, A., Tenhunen, M., Ygge, F.: Integer Programming for Combinatorial Auction Winner Determination. In: Proc. 4th Int. Conf. on Multiagent Systems, ICMAS (2000)
Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, É.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: Proc. of 14th SODA (2003)
Arkin, E.M., Hassin, R.: On local search for weighted k-set packing. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol. 1284. Springer, Heidelberg (1997)
Bafna, V., Narayana, B., Ravi, R.: Nonoverlapping local alignments (Weighted independent sets of axis-parallel rectangles). Discr. Applied Math. 71, 41–53 (1996)
Berman, P.: A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. Nordic J. Computing 7(3), 178–184 (2000)
Berman, P., Krysta, P.: Optimizing misdirection. In: Proc. 14th SODA (2003)
Briest, P., Krysta, P., Vöcking, B.: Approximation Techniques for Utilitarian Mechanism Design. In: Proc. 37th ACM STOC (2005)
Chandra, B., Halldórsson, M.M.: Greedy local improvement and weighted packing approximation. In: Proc. SODA (1999)
Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: Proc. 16th Int. Joint Conference on Artificial Intelligence (IJCAI), pp. 548–553 (1999)
Garg, N., Könemann, J.: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. In: Proc. 39th IEEE FOCS (1998)
Halldórsson, M.M.: A survey on independent set approximations. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 1–14. Springer, Heidelberg (1998)
Hazan, E., Safra, S., Schwartz, O.: On the Hardness of Approximating k-Dimensional Matching. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 83–97. Springer, Heidelberg (2003)
Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover, and set packing problems. Discr. Applied Math. 6, 243–254 (1983)
Krysta, P.: Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 615–627. Springer, Heidelberg (2005)
Lehmann, D., O’Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. In: Proc. 1st ACM Conference on Electronic Commerce, EC (1999)
Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a Universal Test Suite for Combinatorial Auction Algorithms. In: Proc. 2nd ACM Conference on Electronic Commerce, EC (2000)
Mu’alem, A., Nisan, N.: Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. In: Proc. 18th AAAI Conf. on Artificial Intelligence (2002)
Raghavan, P.: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. J. Comput. Syst. Sci. 37(2), 130–143 (1988)
Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365–374 (1987)
Sandholm, T.W.: An algorithm for optimal winner determination in combinatorial auctions. In: Proc. 16th Int. Joint Conf. on Artificial Intelligence (IJCAI), pp. 542–547 (1999)
Srinivasan, A.: A extension of the Lovász Local Lemma and its applications to integer programming. In: Proc. 7th ACM-SIAM SODA (1996)
Srinivasan, A.: Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM J. Computing 29, 648–670 (1999)
de Vries, S., Vohra, R.: Combinatorial Auctions: A Survey. Informs J. Computing 15(3), 284–309 (2003)
Zurel, E., Nisan, N.: An Efficient Approximate Allocation Algorithm for Combinatorial Auctions. In: The Proc. EC (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knoche, J., Krysta, P. (2007). An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. In: Erlebach, T., Kaklamanis, C. (eds) Approximation and Online Algorithms. WAOA 2006. Lecture Notes in Computer Science, vol 4368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11970125_21
Download citation
DOI: https://doi.org/10.1007/11970125_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69513-4
Online ISBN: 978-3-540-69514-1
eBook Packages: Computer ScienceComputer Science (R0)