Enter names, preferences, and proposing side for matches. Review stability, rounds, and fairness indicators clearly. Visual summaries support lessons, hiring models, and allocation drills.
| Member | Group | Preference Order |
|---|---|---|
| Alex | Group A | Jordan, Harper, Riley, Morgan |
| Blake | Group A | Harper, Morgan, Jordan, Riley |
| Casey | Group A | Harper, Riley, Morgan, Jordan |
| Drew | Group A | Riley, Harper, Jordan, Morgan |
| Harper | Group B | Blake, Casey, Alex, Drew |
| Jordan | Group B | Alex, Blake, Casey, Drew |
| Morgan | Group B | Casey, Blake, Drew, Alex |
| Riley | Group B | Drew, Alex, Casey, Blake |
Core method: Gale-Shapley deferred acceptance algorithm.
Proposal rule: Each free proposer selects the highest-ranked option not yet proposed to.
Acceptance rule: A receiver keeps the more preferred proposal and rejects the other one.
Stopping rule: The process ends when no proposer remains free with an untried option.
Receiver comparison:
Choose p over q when rank(receiver, p) < rank(receiver, q)
A lower rank means higher preference.
Stability test:
A matching M is stable if no blocking pair exists.
(x, y) is a blocking pair when x prefers y over M(x), and y prefers x over M(y).
Time complexity: O(n²) for complete preference lists.
Interpretation: The proposing side obtains its proposer-optimal stable matching.
Name: Choice1, Choice2, Choice3.It solves two-sided matching problems where both groups rank each other. The tool produces a stable assignment, meaning no unmatched pair would rather be together than stay with their current partners.
A stable result has no blocking pair. That means there is no person in one group and person in the other group who both prefer each other over their assigned partners.
The proposing side generally receives its best stable outcome under Gale-Shapley. Switching sides can change average ranks, fairness indicators, and the exact final matches.
The calculator adds placeholder slots to the smaller group. This keeps the algorithm balanced and makes unmatched outcomes visible without breaking the stable matching process.
Yes. Missing choices are appended automatically in default order. That keeps the lists complete and lets the algorithm finish, though explicit rankings give more meaningful results.
Rank 1 means a top choice. Lower average ranks indicate better outcomes for that side. Comparing both averages helps you judge whether one side benefited more.
It shows every proposal, rejection, and replacement step. This is helpful for teaching the algorithm, validating preference inputs, and explaining why a final pairing emerged.
Use stable matching when both sides have preferences and mutual satisfaction matters. Simple score sorting can ignore pairwise incentives and may create unstable, easily contested assignments.
Important Note: All the Calculators listed in this site are for educational purpose only and we do not guarentee the accuracy of results. Please do consult with other sources as well.