| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419370 | Discrete Applied Mathematics | 2013 | 5 Pages |
Abstract
We give some upper bounds on the maximum number of stable matchings in the Gale–Shapley marriage model with nn men and nn women. We also characterize, with the use of some graph-theoretical notions, the exact number of such matchings, assuming that the preferences of men and women are given.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ewa Drgas-Burchardt, Zbigniew Świtalski,