A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations.
Wenzheng LiJan VondrákPublished in: FOCS (2022)
Keyphrases
- social welfare
- constant factor approximation algorithm
- mechanism design
- combinatorial auctions
- resource allocation
- greedy algorithm
- bargaining solution
- optimal allocation
- constant factor
- game theory
- approximation algorithms
- lower bound
- utility function
- incomplete information
- objective function
- bidding strategies
- worst case
- auction mechanisms
- sealed bid
- multi agent
- cooperative games
- incentive compatible
- special case
- pareto optimal
- mathematical programming