Strict Preference Stable Matching

How to use Strict Preference Stable Matching

Use deferred acceptance under strict complete preferences, then scan every possible opposite-side pair for a blocking pair. The two proposer-side outcomes can be compared within the same declared model.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Use deferred acceptance under strict complete preferences, then scan every possible opposite-side pair for a blocking pair. The two proposer-side outcomes can be compared within the same declared model.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• 1–50 members per equally sized side. Preference rows follow the side label order and must each list every opposite member exactly once. At most n squared proposals per scenario; the trace retains the first 100.
• No tied or incomplete preferences, capacities, institutional rules, identity matching, fair random draw or welfare optimum. Proposer optimality is only among stable matchings in this narrow model.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.