A Three-Sided Market Attempted

The Prompt

Construct a three-sided matching instance — at least three agents on each of three sides — with ordinal preferences. Attempt to find a stable matching (one in which no triple of agents, one from each side, would all prefer to be matched together over their current assignments). If no stable matching exists, exhibit the blocking triple that proves instability. If one exists, verify its stability. Reflect on what makes the three-sided case structurally different from the two-sided case.

Completion Criteria

The preference lists for all agents, the matching found (or the proof that none is stable), identification of any blocking triple, and a short reflection on the structural difference from two-sided matching.

Students who have attested

No Students have attested this quest yet. Be the first.