Computer Science – Computer Science and Game Theory
Scientific paper
2011-04-12
Computer Science
Computer Science and Game Theory
Based upon an undergraduate thesis written in Hebrew in 2007
Scientific paper
Lying in order to manipulate the Gale-Shapley matching algorithm has been studied by Dubins and Friedman and by Gale and Sotomayor and was shown to be generally more appealing to the proposed-to side (denoted as the women in Gale and Shapley's original paper) than to the proposing side (denoted as men there). It can also be shown that in the case of lying women, for every woman who is better-off due to lying, there exists a man who is worse-off. In this paper, we show that an even stronger dichotomy between the goals of the sexes holds, namely, if no woman is worse-off then no man is better-off, while a form of sisterhood between the lying and the "innocent" women also holds, namely, if none of the former are worse-off, then neither is any of the latter. This paper is based upon an undergraduate ("Amirim") thesis of the first author.
Friedgut Ehud
Gonczarowski Yannai A.
No associations
LandOfFree
On Sisterhood in the Gale-Shapley Matching Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Sisterhood in the Gale-Shapley Matching Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Sisterhood in the Gale-Shapley Matching Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-731060