Computational Complexity in Constraint-based Combinatorial Auctions
This paper analyzes the dynamic programming construction of bundles within the framework of the Winner Determination Problem in Combinatorial Auctions, based on constraint processing. We discuss different approaches to its representation and highlight the corresponding complexity, employing suitable combinatorics from Discrete Mathematics. Our view may enlighten us about the exponential search space-and incidentally pointing to appropriate techniques to cope with this challenge.
Full Text: PDF