Computationally-Feasible Truthful Auctions for Convex Bundles.
Moshe BabaioffLiad BlumrosenPublished in: APPROX-RANDOM (2004)
Keyphrases
- computationally feasible
- mechanism design
- combinatorial auctions
- bayesian analysis
- resource allocation
- auction mechanisms
- convex optimization
- convex hull
- auction protocol
- globally optimal
- convex relaxation
- group buying
- convex functions
- information revelation
- multi unit
- exhaustive search
- risk minimization
- piecewise linear
- online auctions
- game theory