IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p945-968.html
   My bibliography  Save this article

Dynamic Fair Resource Division

Author

Listed:
  • 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)

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.

Suggested Citation

  • Shai Vardi & Alexandros Psomas & Eric Friedman, 2022. "Dynamic Fair Resource Division," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 945-968, May.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:945-968
    DOI: 10.1287/moor.2021.1155
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1155
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1155?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:945-968. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.