Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction

DOI10.1007/978-3-642-29694-9_29zbMath1277.90151OpenAlexW25972458MaRDI QIDQ2866140

Dalila Boughaci

Publication date: 13 December 2013

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_29

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (2)

An effective discrete dynamic convexized method for solving the winner determination problem ⋮ A new hybrid algorithm to solve winner determination problem in multiunit double internet auction

Cites Work

• Unnamed Item
• Towards fast Vickrey pricing using constraint programming
• Future paths for integer programming and links to artificial intelligence
• Heuristics for a bidding problem
• Computationally Manageable Combinational Auctions
• Combinatorial Auctions: A Survey
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Algorithm for optimal winner determination in combinatorial auctions

This page was built for publication: Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction