Abstract
A hyper-heuristic is a high-level method that incorporates a set of low-level heuristics to handle classes of problems rather than solving one problem. In this paper, we propose a choice function hyperheuristic (CFH) for the winner determination problem in combinatorial auctions (WDP). The proposed method is evaluated on various benchmark problems, and compared with the well-known Stochastic Local Search (SLS) for WDP. The experimental study shows that the CFH algorithm is able to find good solution for the winner allocation compared to the SLS.
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
Anderson, 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 Press (July 2000)
Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA Journal of Computing 6(2), 154–160 (1994)
Boughaci, D., Benhamou, B., Drias, H.: A Memetic Algorithm for the Optimal Winner Determination Problem. Soft Computing - A Fusion of Foundations, Methodologies and Applications 13(8-9), 905–917 (2009)
Boughaci, D.: A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions. In: Electronic Notes in Discrete Mathematics, vol. 36, pp. 535–542 (2010)
Boughaci, D., Benhamou, B., Drias, H.: Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions. Journal of Mathematical. Modelling and Algorithms 9(2), 165–180 (2010)
Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: A classification of hyper-heuristic Approaches. In: International Series in Operations Research and Management Science (2010)
Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., zcan, E., Woodward, J.R.: Exploring Hyper-heuristic Methodologies with Genetic Programming. In: Collaborative Computational Intelligence (2009)
Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., zcan, E., Qu, R.: Hyper-heuristics: A Survey of the State of the Art. Technical Report, School of Computer Science and Information Technology, University of Nottingham (2010)
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)
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. Computers and Operations Research 33(8), 2179–2188 (2006)
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)
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, Games 2000, Bilbao, and ISMP 2000, Austin, Atlanta (2000)
McAfee, R., McMillan, P.J.: Auctions and bidding. Journal of Economic Literature 25, 699–738 (1987)
Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of ACM Conference on Electronic Commerce (EC 2000), pp. 1–12. ACM SIGecom, ACM Press (October 2000)
Rothkopf, M.H., Pekee, A., Ronald, M.: Computationally manageable combinatorial auctions. Management Science 44(8), 1131–1147 (1998)
Sandholm, T.: Algorithms for Optimal Winner Determination in Combinatorial Auctions. Artificial Intelligence 135(1-2), 1–54 (1999)
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)
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.: Optimal Winner Determination Algorithms. In: Cramton, P., et al. (eds.) Combinatorial Auctions. MIT Press (2006)
de Vries, S., Vohra, R.: Combinatorial auctions a survey. INFORMS Journal of Computing 15, 284–309 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Lassouaoui, M., Boughaci, D. (2014). A Choice Function Hyper-heuristic for the Winner Determination Problem. In: Terrazas, G., Otero, F., Masegosa, A. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2013). Studies in Computational Intelligence, vol 512. Springer, Cham. https://doi.org/10.1007/978-3-319-01692-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-01692-4_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01691-7
Online ISBN: 978-3-319-01692-4
eBook Packages: EngineeringEngineering (R0)