1 citations · 1 across the 8 of their papers we have counts for
1 paper · 1 filter
Muhammad Maaz
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 sid…