IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i9p1015-d546829.html
   My bibliography  Save this article

Envy-Free Allocation by Sperner’s Lemma Adapted to Rotation Shifts in a Company

Author

Listed:
  • Sagrario Lantarón

    (Departamento de Matemática e Informática Aplicadas a las Ingenierías Civil y Naval, Escuela Técnica Superior de Ingenieros de Caminos, Canales y Puertos, Universidad Politécnica de Madrid, Profesor Aranguren, 3, 28040 Madrid, Spain)

  • Mariló López

    (Departamento de Matemática e Informática Aplicadas a las Ingenierías Civil y Naval, Escuela Técnica Superior de Ingenieros de Caminos, Canales y Puertos, Universidad Politécnica de Madrid, Profesor Aranguren, 3, 28040 Madrid, Spain)

  • Susana Merchán

    (Departamento de Matemática e Informática Aplicadas a las Ingenierías Civil y Naval, Escuela Técnica Superior de Ingenieros de Caminos, Canales y Puertos, Universidad Politécnica de Madrid, Profesor Aranguren, 3, 28040 Madrid, Spain)

  • Javier Rodrigo

    (Departamento de Matemática Aplicada, ICAI, Universidad Pontificia Comillas, 28040 Madrid, Spain)

  • José Samuel Rodríguez

    (Departamento de Didáctica de las Matemáticas, Universidad Autónoma de Madrid, 28049 Madrid, Spain)

Abstract

This article discusses a theoretical construction based on the graph theory to rework the space of potential partitions in envy-free distribution. This work has the objective of applying Sperner’s lemma to the distribution of three rotating shifts for three workers who are to cover a 24 h job position in a company. As a novel feature, worker’s preferences have been modeled as functions of probability for the three shifts, according to salary offers for said shifts. Envy-free allocation was achieved, since each worker received their preferred shift without the need for negotiation between agents in conflict. Adaptation to the type of dynamic situations that arise with rotating shifts, as well as the consideration of probabilistic preferences by workers are some of the main novelties of this work.

Suggested Citation

  • Sagrario Lantarón & Mariló López & Susana Merchán & Javier Rodrigo & José Samuel Rodríguez, 2021. "Envy-Free Allocation by Sperner’s Lemma Adapted to Rotation Shifts in a Company," Mathematics, MDPI, vol. 9(9), pages 1-12, April.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:9:p:1015-:d:546829
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/9/1015/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/9/1015/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Xiaotie Deng & Qi Qi & Amin Saberi, 2012. "Algorithmic Solutions for Envy-Free Cake Cutting," Operations Research, INFORMS, vol. 60(6), pages 1461-1476, December.
    2. Cloutier, John & Nyman, Kathryn L. & Su, Francis Edward, 2010. "Two-player envy-free multi-cake division," Mathematical Social Sciences, Elsevier, vol. 59(1), pages 26-37, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Doğan, Battal, 2016. "Nash-implementation of the no-envy solution on symmetric domains of economies," Games and Economic Behavior, Elsevier, vol. 98(C), pages 165-171.
    2. Bilò, Vittorio & Caragiannis, Ioannis & Flammini, Michele & Igarashi, Ayumi & Monaco, Gianpiero & Peters, Dominik & Vinci, Cosimo & Zwicker, William S., 2022. "Almost envy-free allocations with connected bundles," Games and Economic Behavior, Elsevier, vol. 131(C), pages 197-221.
    3. Vittorio Bil`o & Ioannis Caragiannis & Michele Flammini & Ayumi Igarashi & Gianpiero Monaco & Dominik Peters & Cosimo Vinci & William S. Zwicker, 2018. "Almost Envy-Free Allocations with Connected Bundles," Papers 1808.09406, arXiv.org, revised May 2022.
    4. Xiaotie Deng & Qi Qi & Amin Saberi, 2012. "Algorithmic Solutions for Envy-Free Cake Cutting," Operations Research, INFORMS, vol. 60(6), pages 1461-1476, December.
    5. Erel Segal-Halevi & Shmuel Nitzan & Avinatan Hassidim & Yonatan Aumann, 2020. "Envy-Free Division of Land," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 896-922, August.
    6. Vittorio Bilò & Ioannis Caragiannis & Michele Flammini & Ayumi Igarashi & Gianpiero Monaco & Dominik Peters & Cosimo Vinci & William Zwicker, 2021. "Almost Envy-Free Allocations with Connected Bundles," Post-Print hal-03834506, HAL.

    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:gam:jmathe:v:9:y:2021:i:9:p:1015-:d:546829. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.