Showing 1 - 10 of 7,833
Gale and Shapley (1962) proposed that there is a similar game to the marriage problem called "the roommate problem …". And, they showed that unlike the marriage problem, the roommate problem may have unstable solutions. In other words, the … implements the full set of stable matchings in the existence of stability, and it ends up with Pareto Optimal matching in the …
Persistent link: https://www.econbiz.de/10011716017
This paper analyzes fairness and bargaining in a dynamic bilateral matching market. Traders from both sides of the …
Persistent link: https://www.econbiz.de/10012587476
We show that Ergin & Sönmez's (2006) results which show that for schools it is a dominant strategy to truthfully rank the students under the Boston mechanism, and that the Nash equilibrium outcomes in undominated strategies of the induced game are stable, rely crucially on two assumptions....
Persistent link: https://www.econbiz.de/10011473711
structure of a matching. This paper argues that, under indifferences, also weak blockings should be considered when these … the set of Pareto-stable matchings for the roommate and the marriage models is provided in terms of individually rational … of stable matchings. Some properties of the Pareto-stable matchings shared by the Marriage and Roommate models are …
Persistent link: https://www.econbiz.de/10010284048
We study a class of sequential non-revelation mechanisms in which hospitals make simultaneous take-it-or-leave-it offers to doctors. We prove that all pure strategy subgame perfect equilibriumoutcomes are stable, but the inclusion of contracts shrinks the set of equilibrium outcomes. Our...
Persistent link: https://www.econbiz.de/10012854651
. Comparing the predicted and observed matching patterns, we find that the Gale-Shapley model explains the matches achieved by the … explore whether the estimated mate preferences, in conjunction with the Gale-Shapley algorithm, can explain the matching …
Persistent link: https://www.econbiz.de/10012724797
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a … new matching algorithm for such markets and show that for a general class of large random markets the algorithm will nd a … stable matching with high probability. In particular we allow the number of couples to grow at a near-linear rate …
Persistent link: https://www.econbiz.de/10014044528
We consider two-sided matching markets with couples. First, we extend a result by Klaus and Klijn (2005, Theorem 3 ….3) and show that for any weakly responsive couples market there always exists a "double stable" matching, i.e., a matching … correspondence that assigns all double stable matchings is neither monotonic nor Nash implementable. -- Matching with couples …
Persistent link: https://www.econbiz.de/10003771299
implement the set of stable (i.e., fair) matchings (Theorem 1). We show that our characterization also holds for "sub-implementation …" and "sup-implementation" (Corollaries 3 and 4). Our second main result is a strong impossibility result: under incomplete …
Persistent link: https://www.econbiz.de/10012955586
We consider two-sided matching markets with couples. First, we extend a result by Klaus and Klijn (2005, Theorem 3 ….3) and show that for any weakly responsive couples market there always exists a "double stable" matching, i.e., a matching …
Persistent link: https://www.econbiz.de/10014215597