Journal article icon

Journal article

Fairly allocating contiguous blocks of indivisible items

Abstract:

In this paper, we study the classic problem of fairly allocating indivisible items with the extra feature that the items lie on a line. Our goal is to find a fair allocation that is contiguous, meaning that the bundle of each agent forms a contiguous block on the line. While allocations satisfying the classical fairness notions of proportionality, envy-freeness, and equitability are not guaranteed to exist even without the contiguity requirement, we show the existence of contiguous allocation...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/j.dam.2019.01.036

Authors


More by this author
Institution:
University of Oxford
Department:
Computer Science
Department:
Unknown
Role:
Author
Publisher:
Elsevier Publisher's website
Journal:
Discrete Applied Mathematics Journal website
Volume:
260
Pages:
227-236
Publication date:
2019-02-21
Acceptance date:
2019-01-23
DOI:
ISSN:
0166-218X
Pubs id:
pubs:965689
UUID:
uuid:2777ab3c-3783-4b33-95b1-bd6329cab965
Source identifiers:
965689
Local pid:
pubs:965689

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP