Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier.
Sepehr AssadiThomas KesselheimSahil SinglaPublished in: CoRR (2020)
Keyphrases
- combinatorial auctions
- mechanism design
- resource allocation
- winner determination
- strategy proof
- single item
- multi unit
- approximation algorithms
- multi item
- set covering
- multi unit combinatorial auctions
- auction mechanisms
- special case
- mathematical programming
- game theory
- worst case
- vickrey clarke groves
- incentive compatible
- incentive compatibility
- bidding strategies
- mixed integer
- multi agent
- auction protocol
- genetic algorithm