We propose a simple model in which agents are matched in pairs in order to complete a task of unit size. The preferences of agents are single-peaked and continuous on the amount of time they devote to it. Our model combines features of two models: assignment games (Shapley and Shubik (1971)) and the division problem (Sprumont (1991)). We provide an algorithm (Select-Allocate-Match) that generates a stable and Pareto efficient allocation. We show that stable allocations may fail to exist if either the single-peakedness or the continuity assumption fail. & COPY; 2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).
Stable sharing
Antonio Nicolo;
2023
Abstract
We propose a simple model in which agents are matched in pairs in order to complete a task of unit size. The preferences of agents are single-peaked and continuous on the amount of time they devote to it. Our model combines features of two models: assignment games (Shapley and Shubik (1971)) and the division problem (Sprumont (1991)). We provide an algorithm (Select-Allocate-Match) that generates a stable and Pareto efficient allocation. We show that stable allocations may fail to exist if either the single-peakedness or the continuity assumption fail. & COPY; 2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).
| File | Dimensione | Formato | |
|---|---|---|---|
|
Stable Sharing_April(23).pdf
accesso aperto
Tipologia:
Published (Publisher's Version of Record)
Licenza:
Creative commons
Dimensione
467.42 kB
Formato
Adobe PDF
|
467.42 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
