Polyhedral Clinching Auctions and the AdWords Polytope.
Gagan GoelVahab S. MirrokniRenato Paes LemePublished in: J. ACM (2015)
Keyphrases
- convex hull
- bidding strategies
- lattice points
- stable set
- information revelation
- convex sets
- multi attribute
- group buying
- online auctions
- auction protocol
- multi unit
- extreme points
- resource allocation
- marginal utility
- mechanism design
- semidefinite
- electronic marketplaces
- facet defining inequalities
- feasible solution
- sealed bid auctions
- dual space
- combinatorial auctions
- knapsack problem
- reverse auction
- business owners
- approximation algorithms
- training samples
- special case