Stable matching with preferences derived from a psychological model (Q1820991): Difference between revisions

The authors analyze a problem of stable matching as a generalization action of the stable marriage problem. They assume that a criterion for ranking partners accepted by all participants exists. E.g., in college dormatories students might rank possible roommates according to the distances between each others home towns. The authors show that unique stable matching exists if preferences are single peaked and narcissistic in that each individual considers his own ''position'' in the sense of the criterion (e.g. the location of his own home town) to be best. Moreover, a method to detect whether preferences are single peaked is presented.