Stable Matchings
نویسنده
چکیده
منابع مشابه
The center stable matchings and the centers of cover graphs of distributive lattices
Let I be an instance of the stable marriage (SM) problem. In the late 1990s, Teo and Sethuraman discovered the existence of median stable matchings, which are stable matchings that match all participants to their (lower/upper) median stable partner. About a decade later, Cheng showed that not only are they locally-fair, but they are also globally-fair in the following sense: when G(I) is the co...
متن کاملStable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median stable partner. Moreover, for SM instances, a stable matching has this property if and only if it is a median of the distributive lattice formed by the instance’s stable matchings. In this paper, we show that the above...
متن کاملStable marriages and search frictions
Stable matchings are the primary solution concept for two-sided matching markets with nontransferable utility. We investigate the strategic foundations of stability in a decentralized matching market. Towards this end, we embed the standard marriage markets in a search model with random meetings. We study the limit of steady-state equilibria as exogenous frictions vanish. The main result is tha...
متن کاملAntimatroids Induced by Matchings
An antimatroid is a combinatorial structure abstracting the convexity in geometry. In this paper, we explore novel connections between antimatroids and matchings in a bipartite graph. In particular, we prove that a combinatorial structure induced by stable matchings or maximumweight matchings is an antimatroid. Moreover, we demonstrate that every antimatroid admits such a representation by stab...
متن کاملMedian Stable Matching for College Admissions
We give a simple and concise proof that so-called generalized median stable matchings are well-defined for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the lattices of stable matchings, and the corresponding generalized median stable matchings. JEL classification...
متن کاملThe Stable Matching Linear Program and an Approximate Rural Hospital Theorem with Couples
The deferred acceptance algorithm has been the most commonly studied tool for computing stable matchings. An alternate less-studied approach is to use integer programming formulations and linear programming relaxations to compute optimal stable matchings. Papers in this area tend to focus on the simple ordinal preferences of the stable marriage problem. This paper advocates the use of linear pr...
متن کامل