Computational Complexity in Constraint-based Combinatorial Auctions.
Michael Thomas EgnerWalter HowerPublished in: GI Jahrestagung (2) (2008)
Keyphrases
- combinatorial auctions
- computational complexity
- special case
- winner determination
- resource allocation
- multi unit
- mechanism design
- multi unit combinatorial auctions
- approximation algorithms
- single item
- multi item
- auction mechanisms
- np hard
- bidding strategies
- worst case
- set covering
- evolutionary algorithm
- search algorithm
- multi dimensional
- electronic commerce
- upper bound
- state space
- search space
- auction protocol