Separating the communication complexity of truthful and non-truthful combinatorial auctions.
Sepehr AssadiHrishikesh KhandeparkarRaghuvansh R. SaxenaS. Matthew WeinbergPublished in: STOC (2020)
Keyphrases
- combinatorial auctions
- mechanism design
- winner determination
- resource allocation
- approximation algorithms
- single item
- multi unit
- multi unit combinatorial auctions
- multi item
- mathematical programming
- special case
- set covering
- bidding strategies
- computational complexity
- incomplete information
- decision problems
- worst case
- auction protocol
- metaheuristic
- cost function