example in stable matching theory
C48683
concept
An example in stable matching theory is a specific instance of agents and their preference lists used to illustrate how stable matchings are formed, analyzed, or compared under the theory’s definitions and algorithms.
Instances (1)
| Instance | Via concept surface |
|---|---|
| Gale’s example in stable matching with couples | — |