Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding.
Shaddin DughmiTim RoughgardenQiqi YanPublished in: J. ACM (2016)
Keyphrases
- combinatorial auctions
- winner determination
- mechanism design
- approximation algorithms
- single item
- strategy proof
- incentive compatibility
- multi item
- resource allocation
- multi unit combinatorial auctions
- optimal solution
- mathematical programming
- auction mechanisms
- special case
- vickrey clarke groves
- decision making
- worst case
- dynamic programming
- incentive compatible
- multi unit