A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations.
Wenzheng LiJan VondrákPublished in: CoRR (2021)
Keyphrases
- social welfare
- constant factor approximation algorithm
- combinatorial auctions
- mechanism design
- constant factor
- approximation algorithms
- greedy algorithm
- resource allocation
- bargaining solution
- optimal allocation
- utility function
- lower bound
- objective function
- game theory
- incomplete information
- np hard
- cooperative
- game theoretic
- incentive compatible
- pareto optimal
- dynamic programming
- special case
- bidding strategies
- scheduling problem
- coalition formation
- auction mechanisms
- search algorithm
- optimization algorithm
- upper bound