Question: 1. The deferred acceptance algorithm. Consider a matching market with four firms, f1, f2, f3 and f4 and five workers, w1, w2, w3, w4 and
1. The deferred acceptance algorithm. Consider a matching market with four firms, f1, f2, f3 and f4 and five workers, w1, w2, w3, w4 and w5 with preferences P(f1) = w1, w5, w4, w3, w2 P(w1) = f4, f2, f1, f3 P(f2) = w1, w3, w5, w2, w4 P(w2) = f1, f2, f3, f4 P(f3) = w4, w2, w3, w5, w1 P(w3) = f1, f3, f4, f2 P(f4) = w5, w3, w2, w1, w4 P(w4) = f4, f2, f1, f3 P(w5) = f4, f2, f3, f1 (a) Write down an unstable matching in which every firm is matched to a worker. What is the matching's blocking pair?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
