Trabajo publicado como artículo en International Journal of Game Theory 34(1): 1-11 (2006).-- http://dx.doi.org/10.1007/s00182-006-0009-6
We give a simple and concise proof that so-called generalized median stable matchings are well-defined stable matchings 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