Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier.
Sepehr AssadiThomas KesselheimSahil SinglaPublished in: SODA (2021)
Keyphrases
- combinatorial auctions
- mechanism design
- strategy proof
- winner determination
- resource allocation
- auction mechanisms
- vickrey clarke groves
- approximation algorithms
- multi unit
- mathematical programming
- multi item
- multi unit combinatorial auctions
- single item
- incomplete information
- game theory
- worst case
- incentive compatible
- special case
- incentive compatibility
- cooperative
- multi agent
- decision problems
- bidding strategies
- electronic commerce
- optimization problems
- set covering
- multi objective