Suppose that we run Gale and Shapley's algorithm for n men and n women where n is an even integer. In the solution that Gale and Shapley's algorithm finds, suppose that a man or a women is married to someone in the first half of his or her preference list, then we say he or she is happy with the matching. Prove that in the matching output by Gale and Shapley's algorithm, at least one person (man or woman) is happy with the matching.

Question

Ashlee Carroll

Social Studies

20 September, 16:22

Suppose that we run Gale and Shapley's algorithm for n men and n women where n is an even integer. In the solution that Gale and Shapley's algorithm finds, suppose that a man or a women is married to someone in the first half of his or her preference list, then we say he or she is happy with the matching. Prove that in the matching output by Gale and Shapley's algorithm, at least one person (man or woman) is happy with the matching.

+3

Answers (1)

Know the Answer?

Yusuf Nelson · Answer 1

Answer: Algorithms comparison

Explanation: Since N = Men, N = Women.

And N is an Invisible Integer, which is called 2.

being married to someone in his first half of life = 1/2 + N

whether Man or Women = 1/2 + 2.