DeepAI AI Chat
Log In Sign Up

Maximizing Nash Social Welfare in 2-Value Instances

07/19/2021
∙
by   Hannaneh Akrami, et al.
∙
0
∙

We consider the problem of maximizing the Nash social welfare when allocating a set 𝒢 of indivisible goods to a set 𝒩 of agents. We study instances, in which all agents have 2-value additive valuations: The value of every agent i ∈𝒩 for every good j ∈𝒢 is v_ij∈{p,q}, for p,q ∈ℕ, p ≤ q. Maybe surprisingly, we design an algorithm to compute an optimal allocation in polynomial time if p divides q, i.e., when p=1 and q ∈ℕ after appropriate scaling. The problem is -hard whenever p and q are coprime and p ≥ 3. In terms of approximation, we present positive and negative results for general p and q. We show that our algorithm obtains an approximation ratio of at most 1.0345. Moreover, we prove that the problem is -hard, with a lower bound of 1.000015 achieved at p/q = 4/5.

READ FULL TEXT

page 1

page 2

page 3

page 4

∙ 06/28/2021

Nash Social Welfare for 2-value Instances

We study the problem of allocating a set of indivisible goods among agen...
∙ 07/22/2022

Maximizing Nash Social Welfare in 2-Value Instances: The Half-Integer Case

We consider the problem of maximizing the Nash social welfare when alloc...
∙ 02/14/2022

Optimizing over Serial Dictatorships

Motivated by the success of the serial dictatorship mechanism in social ...
∙ 11/18/2017

Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System

This paper proposes a novel game-theoretical autonomous decision-making ...
∙ 07/05/2022

Nash Welfare Guarantees for Fair and Efficient Coverage

We study coverage problems in which, for a set of agents and a given thr...
∙ 08/08/2020

Online Nash Social Welfare via Promised Utilities

We consider the problem of allocating a set of divisible goods to N agen...