Complementarities in childcare allocation under priorities

08/28/2023
by   Ata Atay, et al.
0

We investigate the allocation of children to childcare facilities and propose solutions to overcome limitations in the current allocation mechanism. We introduce a natural preference domain and a priority structure that address these setbacks, aiming to enhance the allocation process. To achieve this, we present an adaptation of the Deferred Acceptance mechanism to our problem, which ensures strategy-proofness within our preference domain and yields the student-optimal stable matching. Finally, we provide a maximal domain for the existence of stable matchings using the properties that define our natural preference domain. Our results have practical implications for allocating indivisible bundles with complementarities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2018

Preference Cycles in Stable Matchings

Consider the stable matching problem on two sets. We introduce the conce...
research
11/21/2019

An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties

We study a variant of the Student-Project Allocation problem with lectur...
research
10/23/2019

NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems

The popular matching problem is of matching a set of applicants to a set...
research
09/01/2021

Fairness based Multi-Preference Resource Allocation in Decentralised Open Markets

In this work, we focus on resource allocation in a decentralised open ma...
research
09/05/2021

Balanced House Allocation

We introduce balancedness a fairness axiom in house allocation problems....
research
02/15/2019

Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists

In the stable marriage problem (SM), a mechanism that always outputs a s...

Please sign up or login with your details

Forgot password? Click here to reset