AI Chat AI Image Generator AI Video Text to Speech

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

03/18/2021

∙

by Wenzheng Li, et al.

∙

∙

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.

Wenzheng Li
7 publications
Jan Vondrak
16 publications

page 1

page 2

page 3

page 4

research

∙ 09/09/2023

A constant factor approximation for Nash social welfare with subadditive valuations

We present a constant-factor approximation algorithm for the Nash social...

0 Shahar Dobzinski, et al. ∙

research

∙ 11/07/2022

Approximating Nash Social Welfare by Matching and Local Search

For any ε>0, we give a simple, deterministic (6+ε)-approximation algorit...

0 Jugal Garg, et al. ∙

research

∙ 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 ...

0 Wenzheng Li, et al. ∙

research

∙ 10/12/2022

Better Approximation for Interdependent SOS Valuations

Submodular over signal (SOS) defines a family of interesting functions f...

0 Pinyan Lu, et al. ∙

research

∙ 12/28/2019

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

We study the problem of approximating maximum Nash social welfare (NSW) ...

0 Jugal Garg, et al. ∙

research

∙ 11/02/2020

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

We introduce a risk-aware multi-objective Traveling Salesperson Problem ...

0 Rishab Balasubramanian, et al. ∙

research

∙ 05/04/2023

Fair Multiwinner Elections with Allocation Constraints

We consider the multiwinner election problem where the goal is to choose...

0 Ivan-Aleksandar Mavrov, et al. ∙