Text

Efficient Fair Division with Minimal Sharing

A collection of objects, some of which are good and some of which are bad, is to be divided fairly among agents with different tastes, modeled by additive utility functions. If the objects cannot be shared, so that each of them must be entirely allocated to a single agent, then a fair division may not exist. What is the smallest number of objects that must be shared between two or more agents to attain a fair and efficient division? In this paper, fairness is understood as proportionality or envy-freeness and efficiency as fractional Pareto-optimality. We show that, for a generic instance of the problem (all instances except a zero-measure set of degenerate problems), a fair fractionally Pareto-optimal division with the smallest possible number of shared objects can be found in polynomial time, assuming that the number of agents is fixed. The problem becomes computationally hard for degenerate instances, where agents’ valuations are aligned for many objects.

Ketersediaan

Informasi Detail

Judul Seri

OPERATIONS RESEARCH; Vol.70 No.3 May-June 2022

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 1762-1782

Bahasa

English

ISBN/ISSN

-

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

POLYNOMIAL-TIME ALGORITHM
PROPORTIONAL FAIRNESS
FAIR DIVISION
DISCRETE OBJECTS
FRACTIONAL PARETO-OPTIMALITY
ENVY-FREENESS

Info Detail Spesifik

https://doi.org/10.1287/opre.2022.2279

Pernyataan Tanggungjawab

Fedor Sandomirskiy, Erel Segal-Halevi

Versi lain/terkait

Lampiran Berkas

Komentar