Tensions in Practice: Who proposes changes the stable pairing¶
Two applicants and two studios
Imagine applicants A and B and studios X and Y, with one place each and no allocation by price. A ranks X above Y; B ranks Y above X. X ranks B above A; Y ranks A above B. All pairings are acceptable. A stable assignment has no unpaired applicant and studio who both prefer each other to their assigned partners. Letting either side propose first produces a different stable assignment in this finite example.
Favor applicant preferences
Choose the stable assignment best for the applicants in this profile.
Favor studio preferences
Choose the stable assignment best for the studios in the same profile.
Why these aims pull against each other
Stability rules out a mutually preferred defection; it does not choose which side receives its favorite partners. Here the two sides cannot both get every first choice.
Choose an arrangement to see what changes and what remains difficult.
Compare the same rows across alternatives. Cells state explicit toy quantities, membership or permissions; colors do not supply additional meaning.
What this choice protects
What it costs
When it fits
Compare the arrangements
Applicants propose
A proposes to X and B to Y. Neither studio receives competing proposals, so both accept. Unpaired A–Y and B–X cannot block: the applicant prefers the current partner.
| First choice | Assigned | Own rank | |
|---|---|---|---|
| Applicant A | X | X | 1 |
| Applicant B | Y | Y | 1 |
| Studio X | B | A | 2 |
| Studio Y | A | B | 2 |
- What it protects
- Both applicants receive their first choice while every participant is paired.
- What it costs
- Both studios receive their second choice; stability does not remove this distributive cost.
- When it fits
- Plausible when the institution explicitly prioritizes the applicant side within stable assignments.
Illustration note: This is an editorial, deliberately bounded illustration. Its stated rules and any numbers are invented, not observations, recommended settings, or predictions.
Studios propose
X proposes to B and Y to A. Both accept. Unpaired A–X and B–Y cannot block: the studio prefers the current partner.
| First choice | Assigned | Own rank | |
|---|---|---|---|
| Applicant A | X | Y | 2 |
| Applicant B | Y | X | 2 |
| Studio X | B | B | 1 |
| Studio Y | A | A | 1 |
- What it protects
- Both studios receive their first choice while every participant is paired.
- What it costs
- Both applicants receive their second choice; the same stability test permits this result.
- When it fits
- Plausible when studio priorities are the institution’s declared objective and this allocation rule is legitimate.
Illustration note: This is an editorial, deliberately bounded illustration. Its stated rules and any numbers are invented, not observations, recommended settings, or predictions.
What this illustration does—and does not—establish
The source establishes the structural tension; the concrete alternatives and their conditional costs are editorial synthesis. No arrangement is a universal recommendation.
- The invented rankings are strict, complete, fixed, one-to-one and mutually acceptable. Ties, couples, quotas and strategic reporting are outside this model.
- This profile has two stable assignments. Some profiles have a unique stable assignment; the example does not claim every matching must disadvantage a side.
- Ranks are ordinal positions, not comparable quantities of welfare or a fairness score.
Source entries
Two-Sided Matching
Two sided matching Every stable matching favors one side at the expense of the other supplies the local tension. The setting, alternative arrangements, and stipulated consequences are editorial applications.
Every stable matching favors one side at the expense of the other
The choice of who proposes — students or schools, doctors or hospitals — is therefore a distributive decision disguised as a technical one, and it is often invisible to the participants whose welfare it silently allocates.