Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Constraints in fair division

Constraints in fair division The fair allocation of resources to interested agents is a fundamental problem in society. While the majority of the fair division literature assumes that all allocations are feasible, in practice there are often constraints on the allocation that can be chosen. In this survey, we discuss fairness guarantees for both divisible (cake cutting) and indivisible resources under several common types of constraints, including connectivity, cardinality, matroid, geometric, separation, budget, and conflict constraints. We also outline a number of open questions and directions. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Constraints in fair division

ACM SIGecom Exchanges , Volume 19 (2): 16 – Dec 6, 2021

Loading next page...
 
/lp/association-for-computing-machinery/constraints-in-fair-division-j4pgS52RP0

References (73)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2021 Copyright is held by the owner/author(s)
ISSN
1551-9031
eISSN
1551-9031
DOI
10.1145/3505156.3505162
Publisher site
See Article on Publisher Site

Abstract

The fair allocation of resources to interested agents is a fundamental problem in society. While the majority of the fair division literature assumes that all allocations are feasible, in practice there are often constraints on the allocation that can be chosen. In this survey, we discuss fairness guarantees for both divisible (cake cutting) and indivisible resources under several common types of constraints, including connectivity, cardinality, matroid, geometric, separation, budget, and conflict constraints. We also outline a number of open questions and directions.

Journal

ACM SIGecom ExchangesAssociation for Computing Machinery

Published: Dec 6, 2021

Keywords: constraints

There are no references for this article.