Decomposition Based MOEA with Unique Subregions and Stable Matching

2021 ◽  
Author(s):  
Zhixue Wang ◽  
Hanning Chen ◽  
Xiaodan Liang ◽  
Maowei He
Keyword(s):  
Stable Matching

scholarly journals Single cell tracking based on Voronoi partition via stable matching

2020 ◽  
Author(s):  
Young Hwan Chang ◽  
Jeremy Linsley ◽  
Josh Lamstein ◽  
Jaslin Kalra ◽  
Irina Epstein ◽  
...  
Keyword(s):  
Single Cell ◽  
Cell Tracking ◽  
Stable Matching ◽  
Voronoi Partition

Stable Matching with Double Infinity of Workers and Firms

2018 ◽  
Vol 19 (2) ◽  
Author(s):  
Matías Fuentes ◽  
Fernando Tohmé
Keyword(s):  
Stable Matching ◽  
Pareto Optimal ◽  
Stable Matchings ◽  
Large Market ◽  
Countably Infinite

Abstract In this paper we analyze the existence of stable matchings in a two-sided large market in which workers are assigned to firms. The market has a continuum of workers while the set of firms is countably infinite. We show that, under certain reasonable assumptions on the preference correspondences, stable matchings not only exist but are also Pareto optimal.

Near-Feasible Stable Matchings with Couples

2018 ◽  
Vol 108 (11) ◽  
pp. 3154-3169 ◽  
Author(s):  
Thành Nguyen ◽  
Rakesh Vohra
Keyword(s):  
Medical Students ◽  
Stable Matching ◽  
Teaching Hospitals ◽  
Matching Problem ◽  
Stable Matchings ◽  
Student Preferences

The National Resident Matching program seeks a stable matching of medical students to teaching hospitals. With couples, stable matchings need not exist. Nevertheless, for any student preferences, we show that each instance of a matching problem has a “nearby” instance with a stable matching. The nearby instance is obtained by perturbing the capacities of the hospitals. In this perturbation, aggregate capacity is never reduced and can increase by at most four. The capacity of each hospital never changes by more than two. (JEL C78, D47, I11, J41, J44)

Sign in / Sign up

Export Citation Format

Share Document