(This post is typeset using LaTeX2WP)
Today’s lecture gave a formal definition of the resident matching problem that we saw last lecture.
We first made the following two simplifying assumptions:
- Every employer wants to employ exactly one applicant; and
- Each of the applicants applies to each of the employers.
We next saw that the problem above can be interpreted in terms of getting men married to women. (This was first proposed by Gale and Shapley in 1962.)
We then formalized the problem as follows. Let denote the set of men and denote the set of women. The set of all possible pairs is denoted by . We next defined certain terminology that was used to define the problem (and will be used later on in the course).
Definition 1 (Matching) A matching is a subset of such that every man and every woman appears in at most one pair in .
As Andrew quipped in class, when you draw out a matching properly, you get a bunch of straight couples.
Definition 2 (Perfect Matching) A perfect matching is a matching such that every man and woman appears in some pair in .
Note that our output needs to be a perfect matching. Next, we formalized the notion of preferences.
Definition 3 (Preferences) The preference list for a man (woman resp.), denoted by ( resp.), is a total ordering on ( resp.).
Finally, we defined the notion of stability of a matching (by defining its negation):
Definition 4 (Instability) Given a matching , a pair is an instability with respect to if there exist and such that
- and are pairs in ;
- prefers to (i.e. in );
- in .
Note that if is an instability with respect to a matching , then they have the incentive to break their current matchings and form a pair on their own.
Finally, we defined a stable matching:
Definition 5 (Stable Matching) A stable matching is a perfect matching such that there does not exist which is an instability with respect to .
Thus, the stable matching problem can be formally defined as follows:
- Input: The set of men () and women () with along with the preference lists ( resp.) for every ( resp.)
- Output: A stable matching .
We concluded the lecture with the following two natural questions:
- Does there exist a stable marriage for any set of preference lists?
- If so, can we compute such a stable marriage efficiently?
The slides for the lecture have been uploaded.
S is a subset of M X W, such that every man m∈ M and every woman w∈W. Since, we already defined S is a subset of M X W. Why we using same subset ‘S’ in all of the definition of Matching, Perfect Matching, Preferences, Instability and Stable Matching. Each of these sets have different elements. Hence, I guess if we used the subscript in set notation. It will be much more easy to understand, like for Matching (Sm), Perfect Matching, (Spm), Preferences (Sp), Instability (Si) and Stable Matching (Ssm).
I have write this first on MS Word, in order to type subscript on each subset S.
By: Santosh Thapa on September 5, 2009
at 8:22 pm
Hi Santosh,
Generally in a definition only the terms or notations that are defined are assumed to have a global scope while the rest are just local to the definition. In all the definitions above is a local variable and should be interpreted to have scope only limited to the definition it appears in. E.g., in Definition 1, the term “matching” is the only thing being defined and appearing in it should be interpreted to have local scope.
Of course, we could use your terminology of and but I think in this case doing so will make the notation more cumbersome without much benefit. (As a general rule, I try to use as little notation as possible.)
Thanks for binging this up: now everyone knows what convention I had in mind.
By: atri on September 6, 2009
at 1:54 am