Dynamic Fair Resource Division

Shai Vardi (), Alexandros Psomas () and Eric Friedman ()
Additional contact information
Shai Vardi: Krannert School of Management, Purdue University, West Lafayette, Indiana 47907
Alexandros Psomas: Department of Computer Science, Purdue University, West Lafayette, Indiana 47907
Eric Friedman: International Computer Science Institute and Electrical Engineering and Computer Sciences Department, Berkeley, California 94704

Mathematics of Operations Research, 2022, vol. 47, issue 2, 945-968

Abstract: A single homogeneous resource needs to be fairly shared between users that dynamically arrive and depart over time. Although good allocations exist for any fixed number of users, implementing these allocations dynamically is impractical: it typically entails adjustments in the allocation of every user in the system whenever a new user arrives. We introduce a dynamic fair resource division problem in which there is a limit on the number of users that can be disrupted when a new user arrives and study the trade-off between fairness and the number of allowed disruptions, using a fairness metric: the fairness ratio . We almost completely characterize this trade-off and give an algorithm for obtaining the optimal fairness for any number of allowed disruptions.

Keywords: Primary: 90B35; fair division; dynamic resource allocation (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/moor.2021.1155 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormoor:v:47:y:2022:i:2:p:945-968

Access Statistics for this article

More articles in Mathematics of Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().