Abstract
In this paper, both stochastic local search (SLS) and tabu search (TS) are studied for the optimal winner determination problem (WDP) in combinatorial auctions. The proposed methods are evaluated on various benchmark problems, and compared with the hybrid simulated annealing (SAGII), the memetic algorithms (MA) and Casanova. The computational experiments show that the SLS provides competitive results and finds solutions of a higher quality than TS and Casanova methods.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of 4th International Conference on Multi-Agent Systems, pp. 39–46. IEEE Computer Society, July 2000
Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154–160 (1994)
Boughaci, D., Drias, H., Benhamou, B.: Stochastic local search for the optimal winner determination problem in combinatorial auctions. In: The International Conference on Constraint Programming, CP 2008. LNCS, pp. 593–597 (2008)
Boughaci, D., Drias, H., Benhamou, B.: A memetic algorithm for the optimal winner determination problem. In: Soft Computing—a Fusion of Foundations, Methodologies and Applications, vol. 13, no. 8–9, pp. 905–917. Springer, Berlin (2008)
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. 48–53 (1999)
Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533–549 (1986)
Glover, F.: Tabu search: part I. ORSA J. Comput. 1(3):190–206 (1989)
Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: Heuristics for a brokering set packing problem. In: Proceedings of eighth international symposium on artificial intelligence and mathematics, pp. 10–14 (2004)
Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: Heuristics for a bidding problem. Comput. Oper. Res. 33(8), 2179–2188 (2006)
Holland, A., O’sullivan, B.: Towards fast Vickrey pricing using constraint programming. Artif. Intell. Rev. 21(3–4), 335–352 (2004)
Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp. 22–29 (2000)
Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of the 19th National Conference on Artificial Intelligence AAAI/IAAI 2002, pp. 655–660 (2002)
Lau, H.C., Goh, Y.G.: An intelligent brokering system to support multi-agent web-based 4th-party logistics. In: Proceedings of the 14th International Conference on Tools with Artificial Intelligence, pp. 54–61 (2002)
Leyton-Brown, K., Tennenholtz, M., Shoham, Y.: An algorithm for multi-unit combinatorial auctions. In: Proceedings of the 17th National Conference on Artificial Intelligence, Austin, Games-2000, Bilbao, and ISMP-2000, Atlanta (2000b)
McAfee, R., McMillan, P.J.: Auctions and bidding. J. Econ. Lit. 25, 699–738 (1987)
Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of ACM Conference on Electronic Commerce (EC’00), pp. 1–12. Minneapolis: ACM SIGecom, ACM, October (2000)
Rothkopf, M.H., Pekee, A., Ronald, M.: Computationally manageable combinatorial auctions. Manage. Sci. 44(8), 1131–1147 (1998)
Sandholm, T.: Algorithms for optimal winner determination in combinatorial auctions. Artif. Intell. 135(1–2), 1–54 (1999)
Sandholm, T.: Optimal winner determination algorithms. In: Cramton, P., et al. (ed.), Combinatorial Auctions. MIT, Cambridge (2006)
Sandholm, T., Suri, S.: Improved optimal algorithm for combinatorial auctions and generalizations. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp. 90–97 (2000)
Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABoB: a fast optimal algorithm for combinatorial auctions. In: Proceedings of the International Joint Conferences on Artificial Intelligence, pp. 1102–1108 (2001)
Vries de, S., Vohra, R.: Combinatorial auctions a survey. INFORMS J. Comput. 15, 284–309 (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Boughaci, D., Benhamou, B. & Drias, H. Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions. J Math Model Algor 9, 165–180 (2010). https://doi.org/10.1007/s10852-010-9127-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-010-9127-z