A latin square \(A\) of order \(n\) is an \(n\times n\) matrix where each row and column is a permutation of the elements in \(\{0,1, \dots, n-1\}\). Let \(a_{ij}\) be man \(i\)'s ranking of woman \(j\) and \(n-1- a_{ij}\) be woman \(j\)'s ranking of man \(i\). A matching into married partners is unstable if at least one man and one woman prefer each other to their assigned partners. The authors construct a ``latin stable marriage problem of even order that provides a new lower bound on the maximum number of stable matchings for problems of even order and is comparable to a known lower bound when the order is a power of 2.
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- A number of stable matchings in models of the Gale-Shapley type
- Stability and stabilisation of networked pairing problem via event-triggered control
- Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings
- Review of the theory of stable matchings and contract systems
This page was built for publication: How do I marry thee? Let me count the ways
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893161)
