Conference item icon

Conference item

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
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-319-66700-3_26

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Publisher:
Springer Publisher's website
Publication date:
2017-08-19
Acceptance date:
2017-06-20
DOI:
EISSN:
1611-3349
ISSN:
0302-9743
Pubs id:
pubs:922613
URN:
uri:d69cabae-ba5a-485c-adf9-8de84f1d6dc2
UUID:
uuid:d69cabae-ba5a-485c-adf9-8de84f1d6dc2
Local pid:
pubs:922613

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