Approximation Algorithms for Budget-Constrained Auctions.
Rahul GargVijay KumarVinayaka PanditPublished in: RANDOM-APPROX (2001)
Keyphrases
- approximation algorithms
- combinatorial auctions
- np hard
- special case
- vertex cover
- budget constraints
- worst case
- minimum cost
- facility location problem
- network design problem
- exact algorithms
- multi attribute
- primal dual
- approximation schemes
- winner determination
- set cover
- np hardness
- constant factor
- precedence constraints
- bidding strategies
- approximation ratio
- online auctions
- polynomial time approximation
- objective function
- disjoint paths
- mechanism design
- integer programming
- lower bound