Abstract: We study a general doctors, hospitals and regions matching model with complex distributional constraints. Every hospital faces floor and ceiling constraints on the number of doctors, and every region which has several hospitals also faces its floor and ceiling constraints on the number of doctors. We examine how to assign doctors to hospitals and regions in an efficient, fair, stable, and strategy-proof way. We propose two mechanisms for finding such solutions, and examine their properties and policy implications.

“Strategy-proof rules in object allocation problems with hard budget constraints and income effects”
Yuya Wakabayashi (Kyoto university)
“Sequential dictatorship rules in multi-unit object assignment problems with money”
Masahiro Kawasaki (Kyoto university)
“Dynamic Many-to-One Matching under Constraints”
Rui He (Kyoto university)