Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/10261/1778
Full metadata record
DC FieldValueLanguage
dc.creatorKlaus, Bettina-
dc.creatorKlijn, Flip-
dc.date2007-10-31T15:49:17Z-
dc.date2007-10-31T15:49:17Z-
dc.date2006-02-16-
dc.date.accessioned2017-01-31T00:57:51Z-
dc.date.available2017-01-31T00:57:51Z-
dc.identifierhttp://hdl.handle.net/10261/1778-
dc.identifier.urihttp://dspace.mediu.edu.my:8181/xmlui/handle/10261/1778-
dc.descriptionTrabajo 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-
dc.descriptionWe 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-
dc.languageeng-
dc.relationUFAE and IAE Working Papers-
dc.relation632.04-
dc.rightsopenAccess-
dc.subjectMatching-
dc.subjectCollege admissions problem-
dc.subjectStability-
dc.subjectFairness-
dc.titleMedian Stable Matching for College Admission-
dc.typeDocumento de trabajo-
Appears in Collections:Digital Csic

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.