The Maximin Share Dominance Relation

12/18/2019
by   Erel Segal-Halevi, et al.
0

Given a finite set X and an ordering ≽ over its subsets, the l-out-of-d maximin-share of X is the maximal (by ≽) subset of X that can be constructed by partitioning X into d parts and picking the worst union of l parts. A pair of integers (l,d) dominates a pair (l',d') if, for any set X and ordering ≽, the l-out-of-d maximin-share of X is at least as good (by ≽) as the l'-out-of-d' maximin-share of X. This note presents a necessary and sufficient condition for deciding whether a given pair of integers dominates another pair, and an algorithm for finding all non-dominated pairs. It compares the l-out-of-d maximin-share to some other criteria for fair allocation of indivisible objects among people with different entitlements.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2022

Fair Shares: Feasibility, Domination and Incentives

We consider fair allocation of a set M of indivisible goods to n equally...
research
05/16/2018

Fair Allocation of Indivisible Items With Externalities

One of the important yet insufficiently studied subjects in fair allocat...
research
02/06/2020

Generalized Pair Weights of Linear Codes and MacWilliams Extension Theorem

In this paper, we introduce the notion of generalized pair weights of an...
research
02/01/2023

On Hill's Worst-Case Guarantee for Indivisible Bads

When allocating objects among agents with equal rights, people often eva...
research
07/10/2019

An algorithmic framework for approximating maximin share allocation of chores

In this paper, we consider the problem of how to fairly dividing m indiv...
research
11/22/2020

On algorithms to find p-ordering

The concept of p-ordering for a prime p was introduced by Manjul Bhargav...
research
04/26/2023

Reconfiguration of the Union of Arborescences

An arborescence in a digraph is an acyclic arc subset in which every ver...

Please sign up or login with your details

Forgot password? Click here to reset