Envy-Free Allocation by Sperner’s Lemma Adapted to Rotation Shifts in a Company
| Autor: | José Samuel Rodríguez, Javier Rodrigo, Mariló López, Susana Merchán, Sagrario Lantarón |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Computer science
General Mathematics 0211 other engineering and technologies Rework 02 engineering and technology Space (commercial competition) Sperner's lemma 01 natural sciences rental harmony Position (vector) envy-free allocation Computer Science (miscellaneous) QA1-939 0101 mathematics Engineering (miscellaneous) Lemma (mathematics) 021103 operations research 010102 general mathematics Probabilistic logic Graph theory Sperner’s lemma probabilistic preferences Combinatorial optimization combinatorial optimization Mathematical economics Mathematics rotating shifts |
| Zdroj: | Mathematics, Vol 9, Iss 1015, p 1015 (2021) Mathematics Volume 9 Issue 9 |
| ISSN: | 2227-7390 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|