Inapproximability for VCG-Based Combinatorial Auctions.
David BuchfuhrerShaddin DughmiHu FuRobert KleinbergElchanan MosselChristos H. PapadimitriouMichael SchapiraYaron SingerChristopher UmansPublished in: SODA (2010)
Keyphrases
- combinatorial auctions
- approximation algorithms
- winner determination
- np hard
- mechanism design
- worst case
- special case
- multi item
- multi unit
- multi unit combinatorial auctions
- single item
- game theoretic
- vickrey clarke groves
- resource allocation
- auction protocol
- mathematical programming
- auction mechanisms
- strategy proof
- coalition formation
- bidding strategies
- multi dimensional
- upper bound
- genetic algorithm