The Computational Complexity of Truthfulness in Combinatorial Auctions
Shahar DobzinskiJan VondrákPublished in: CoRR (2012)
Keyphrases
- combinatorial auctions
- mechanism design
- computational complexity
- special case
- winner determination
- resource allocation
- multi unit
- approximation algorithms
- multi unit combinatorial auctions
- single item
- mathematical programming
- multi item
- set covering
- game theoretic
- auction mechanisms
- auction protocol
- worst case
- bidding strategies
- search algorithm
- multi objective
- incomplete information
- decision problems
- probability distribution
- np hard