Pith. sign in

REVIEW

New Fairness Concepts for Allocating Indivisible Items

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.01710 v3 pith:VQI4NPKR submitted 2022-06-03 cs.GT

classification cs.GT
keywords fairnessconceptsallocationsalwaysexisteefxindivisibleitems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

For the fundamental problem of fairly dividing a set of indivisible items among agents, envy-freeness up to any item (EFX) and maximin fairness (MMS) are arguably the most compelling fairness concepts proposed until now. Unfortunately, despite significant efforts over the past few years, whether EFX allocations always exist is still an enigmatic open problem, let alone their efficient computation. Furthermore, today we know that MMS allocations are not always guaranteed to exist. These facts weaken the usefulness of both EFX and MMS, albeit their appealing conceptual characteristics. We propose two alternative fairness concepts, called epistemic EFX (EEFX) and minimum EFX share fairness (MXS), inspired by EFX and MMS. For both, we explore their relationships to well-studied fairness notions and, more importantly, prove that EEFX and MXS allocations always exist and can be computed efficiently for additive valuations. Our results justify that the new fairness concepts can be excellent alternatives to EFX and MMS.

Discussion (0). Sign in to comment.

Pith tools