论文标题
饱和稳定的比赛
Saturating stable matchings
论文作者
论文摘要
我将双方图形匹配与稳定的匹配相关联。我证明了存在饱和稳定匹配的必要条件，其中所有可能的偏好都匹配了一侧的每个代理。我将分析扩展到完美的稳定匹配，在该比赛中，双方的每个代理都匹配。
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.
