Saturating stable matchings |
| |
Affiliation: | University of Toronto, Canada |
| |
Abstract: | I relate bipartite graph matchings to stable matchings. I prove a necessary and sufficient condition for the existence of a saturating stable matching, where every agent on one side is matched, for all possible preferences. I extend my analysis to perfect stable matchings, where every agent on both sides is matched. |
| |
Keywords: | Two-sided matching Stable marriage Graph theory |
本文献已被 ScienceDirect 等数据库收录! |