Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders.
Shahar DobzinskiPublished in: STOC (2016)
Keyphrases
- combinatorial auctions
- winner determination
- mechanism design
- resource allocation
- greedy algorithm
- approximation algorithms
- worst case
- single item
- multi unit
- multi unit combinatorial auctions
- multi item
- special case
- auction mechanisms
- social welfare
- bidding strategies
- mathematical programming
- objective function
- auction protocol
- vickrey clarke groves