Question: Give an example of a stable matching instance with 4 riders and 4 horses, with stable matchings M 1 and M 2 such that for

Give an example of a stable matching instance with 4 riders and 4 horses, with stable matchings M1 and M2 such that for some riders r1 and r2:
r1 prefers their match in M1 to their match in M2
r2 prefers their match in M2 to their match in M1
Note that this requires r1 and r2 both change partners between M1 and M2.
Hint: r1 and r2 might not be the only riders changing partners, and r1 and r2 may not simply be switching partners with each other.

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 Programming Questions!