Mon, 05/02/2022 - 19:18
0
10/05/2022
Título: Stable pairing
Sala: E28
Hora: 12:30
Abstract: We propose a simple model of job sharing. Agents are matched in pairs in order to complete a job of unit size. The preferences of agents are single-peaked and continuous on the amout of time they work. 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 allocation. We show that stable allocations may fail to exist if either the single-peakedness or the continuity assumption fail.