Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations.
Siddharth BarmanUmang BhaskarAnand KrishnaRanjani G. SundaramPublished in: ESA (2020)
Keyphrases
- approximation algorithms
- worst case
- combinatorial auctions
- lower bound
- np hard
- special case
- upper bound
- facility location problem
- minimum cost
- vertex cover
- approximation schemes
- disjoint paths
- primal dual
- greedy algorithm
- open shop
- exact algorithms
- set cover
- mechanism design
- constant factor
- np hardness
- approximation ratio
- winner determination
- computational complexity
- mixed integer
- undirected graph
- error bounds
- scheduling problem
- network design problem
- bidding strategies
- randomized algorithms
- polynomial time approximation
- objective function
- constant factor approximation