From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders
Shaddin DughmiTim RoughgardenQiqi YanPublished in: CoRR (2011)
Keyphrases
- multiscale
- combinatorial auctions
- convex optimization
- winner determination
- mechanism design
- single item
- resource allocation
- strategy proof
- incentive compatibility
- auction mechanisms
- interior point methods
- multi unit
- approximation algorithms
- mathematical programming
- total variation
- convex relaxation
- multi unit combinatorial auctions
- primal dual
- greedy algorithm
- special case
- convex optimization problems
- incentive compatible
- objective function
- image segmentation
- vickrey clarke groves
- bidding strategies
- dynamic programming
- optimal solution
- false name proof
- genetic algorithm