Accessibility statement

Stable Job Sharing (joint with Pietro Salmaso, Arunava Sen, and Sonal Yadav)

Wednesday 30 October 2019, 1.00PM to 2.00 pm

Speaker(s): Antonio Nicolò (Padua/Manchester)

Host: Jorgen Kratz

Abstract: Job sharing is a type of flexible work arrangement in which two people work part-time schedules to complete the work one person would do in a single full-time. In this paper we propose a novel matching model for job sharing. We consider a pool of workers of a firm who are interested in job sharing. Workers have single-peaked preferences over their working hours. Every pair of workers have to complete the schedule one person would do in a single full-time job, that we normalize to one. We look for an allocation, consisting of a matching of workers in pairs and a time schedule for each worker, that is efficient and stable, meaning that no pair of workers could find a different arrangement, either by splitting differently their workload or by changing their partners and matching together, that strictly benefit both of them. We propose a matching algorithm that finds a stable and efficient allocation of workers in pairs.

1:1 appointment: click here

Location: A/D271 (ERC above Alcuin Porters)

Admission: Staff and PhD