An impossibility result for truthful combinatorial auctions with submodular valuations.
Shahar DobzinskiPublished in: STOC (2011)
Keyphrases
- combinatorial auctions
- mechanism design
- winner determination
- resource allocation
- multi unit
- approximation algorithms
- single item
- special case
- multi item
- mathematical programming
- multi unit combinatorial auctions
- set covering
- greedy algorithm
- auction mechanisms
- objective function
- auction protocol
- incomplete information
- similarity search
- cooperative
- decision making
- genetic algorithm