The computational complexity of truthfulness in combinatorial auctions.
Shahar DobzinskiJan VondrákPublished in: EC (2012)
Keyphrases
- combinatorial auctions
- mechanism design
- computational complexity
- special case
- winner determination
- approximation algorithms
- resource allocation
- single item
- multi item
- multi unit
- multi unit combinatorial auctions
- np hard
- auction mechanisms
- decision problems
- set covering
- auction protocol
- mathematical programming
- state space
- worst case
- multi objective