A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations

03/18/2021
by   Wenzheng Li, et al.
0

We present a 380-approximation algorithm for the Nash Social Welfare problem with submodular valuations. Our algorithm builds on and extends a recent constant-factor approximation for Rado valuations.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/06/2021

Estimating the Nash Social Welfare for coverage and other submodular valuations

We study the Nash Social Welfare problem: Given n agents with valuation ...
05/01/2020

Uniform Welfare Guarantees Under Identical Subadditive Valuations

We study the problem of allocating indivisible goods among agents that h...
02/16/2020

Pipeline Interventions

We introduce the pipeline intervention problem, defined by a layered dir...
12/28/2019

Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings

We study the problem of approximating maximum Nash social welfare (NSW) ...
10/02/2021

Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations

We study the problem of allocating indivisible goods among n agents with...
12/06/2020

Maximizing Social Welfare in a Competitive Diffusion Model

Influence maximization (IM) has garnered a lot of attention in the liter...
11/02/2020

Risk-Aware Submodular Optimization for Multi-objective Travelling Salesperson Problem

We introduce a risk-aware multi-objective Traveling Salesperson Problem ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.