Question: The Problem The stable marriage problem does not handle divorces. This is because we assume everyone is interested in everyone else of the opposite sex

The Problem
The stable marriage problem does not handle divorces. This is because we assume everyone is interested in everyone else of the opposite sex and we assume that the
preferences do not change.
In this problem, we will see the effect of changes in preferences in the outcome of the Gale-Shapley algorithm. In this problem, assume that men propose to women (as
done in the book and unlike what we did in the lecture) and consider the following scenario.
Given an instance of the stable marriage problem (i.e. set of women W and the set of men M along with their preference lists: Lw and Lm for every winW and minM
respectively), call a woman winW a reformer if the following property holds. There exists an Lw' such that if w changes her preference list to Lw'(from Lw) then the Gale-
Shapley algorithm matches everyone to someone else. In other words, let Sorig be the stable marriage output by the Gale-Shapley algorithm for the original input and Snew be
the stable marriage output by the Gale-Shapley algorithm for the new instance of the problem where w''s preference list is replaced by Lw'(but everyone else has the same
preference list as before). Then
SorigSnew=O.
Here are the two parts:
Part (a): You will first solve a simpler version of the problem. For every integer n3 argue the following: There exists an instance of the stable marriage problem with
n men and n women such that there is a woman w such that if she changes her preference list from Lw to Lw' then we have
SorigSnew.
Part (b): For every integer n3 argue the following: There exists an instance of the stable marriage problem with n men and n women such that there is a woman
who is a reformer.
Common Mistake
A common mistake for this problem is to present an instance that solves part (a) but not part (b).
 The Problem The stable marriage problem does not handle divorces. This

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!