Research Workbench

Eligibility maximum matching

Check how many eligible one-to-one assignments are feasible.

Your entries stay in this page’s memory and are not submitted to us. Downloads are generated locally. Reloading or leaving the page clears your entries. Do not enter patient information.

Follow the labeled row format. Use synthetic values only. All calculations stay in your browser; no uploads. Finite magnitudes up to 1e9 and at least 1e-12, or zero.

The starting values are hypothetical. Results update as you edit. Use aggregate or synthetic inputs only.

Calculation results

Matched pairs
2
Unmatched rows
1
Unmatched columns
0
Column for each row (-1 unmatched)
1, 0, -1

How to interpret the output

Maximum cardinality one-to-one matching via augmenting paths. A 1 means eligible and 0 means absent. This dense-input convention differs from explicitly stored zero edges in SciPy sparse graphs. No costs, priorities, fairness objective or causal matching claim. Source checked 22 November 2026.

Method reference

Read the worked guide and interpretation examples →