On Maximum Weighted Nash Welfare for Binary Valuations

04/08/2022
by   Warut Suksompong, et al.
0

We consider the problem of fairly allocating indivisible goods to agents with weights representing their entitlements. A natural rule in this setting is the maximum weighted Nash welfare (MWNW) rule, which selects an allocation maximizing the weighted product of the agents' utilities. We show that when agents have binary valuations, a specific version of MWNW is resource- and population-monotone, satisfies group-strategyproofness, and can be implemented in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2023

Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness

We study the problem of fairly allocating indivisible goods to agents wi...
research
12/08/2022

A Characterization of Maximum Nash Welfare for Indivisible Goods

In the allocation of indivisible goods, the maximum Nash welfare (MNW) r...
research
01/10/2023

Extending the Characterization of Maximum Nash Welfare

In the allocation of indivisible goods, the maximum Nash welfare rule ha...
research
08/15/2022

A General Framework for Fair Allocation with Matroid Rank Valuations

We study the problem of fairly allocating a set of indivisible goods amo...
research
09/14/2022

Weighted Envy-Freeness for Submodular Valuations

We investigate the fair allocation of indivisible goods to agents with p...
research
09/23/2019

On Weighted Envy-Freeness in Indivisible Item Allocation

In this paper, we introduce and analyze new envy-based fairness concepts...
research
06/28/2020

The Hylland-Zeckhauser Rule Under Bi-Valued Utilities

The Hylland-Zeckhauser (HZ) rule is a well-known rule for probabilistic ...

Please sign up or login with your details

Forgot password? Click here to reset