Envy-free matchings with one-sided preferences and matroid constraints |
| |
Institution: | Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan |
| |
Abstract: | In this paper, we consider the problem of checking the existence of an envy-free matching in a many-to-one matching model with one-sided preferences and matroid constraints. For this problem, we propose a polynomial-time algorithm which is a generalization of the algorithm proposed by Gan, Suksompong, and Voudouris for the one-to-one setting. Furthermore, we consider a stronger variant of envy-freeness. |
| |
Keywords: | Matching Envy-freeness Matroid |
本文献已被 ScienceDirect 等数据库收录! |
|