A new matching mechanism under relative ditributional constraints

Abstract

A new matching mechanism under relative ditributional constraints. In this paper, we consider a many-to-one matching problem under relative distributional constraints. We propose a new many-to-one matching mechanism that flexibly determines a matching based on the sequential dictatorship mechanism. We theoretically show that our mechanism satisfies strategy-proofness. Furthermore, experimental results show that our proposed mechanism can improve efficiency compared with an existing matching mechanism with relative distributed constraints.