Metraipolis › archive › dc_97ffebca33f3

Stable matching problem — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Stable_matching_problem
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-06T00:39:21.504Z
SHA-256 of the archived text: f0c5b187441ad9db3d2e6dae123b7e62c97f4a5309e5c0f0c6d9bf67df8468aa
Stable URL of this page: https://metraipolis.com/documento/dc_97ffebca33f3

How to cite

Stable matching problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Stable_matching_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_97ffebca33f3 (Metraipolis archive dc_97ffebca33f3, sha256 f0c5b187441ad9db3d2e6dae123b7e62c97f4a5309e5c0f0c6d9bf67df8468aa)

BibTeX

@misc{dc97ffebca33f3,
  title = {Stable matching problem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Stable_matching_problem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_97ffebca33f3; sha256 f0c5b187441ad9db3d2e6dae123b7e62c97f4a5309e5c0f0c6d9bf67df8468aa},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Stable_matching_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, economics, and computer science, the stable matching problem is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a bijection from the elements of one set to the elements of the other set. A matching is not stable if: In other words, a matching is stable when there does not exist any pair (A, B) where both prefer each other to their current partner under the matching. The stable marriage problem has been stated as follows: Given n men and n women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. When there are no such pairs of people, the set of marriages is deemed stable. The existence of two classes that need to be paired with each other (heterosexual men and women in this example) distinguishes this problem from the stable roommates problem.

Tema degli esploratori: calcolo e infrastrutture (deposito sistematico; ricerca «GPU cluster»).
Fonte: Wikipedia in inglese, voce «Stable matching problem» — https://en.wikipedia.org/wiki/Stable_matching_problem
Wikidata Q620702 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q620702
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Stable_matching_problem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378259793, consultata il 2026-10-05T23:51:10.810Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a5888001d710ffd214e721215fae6a9ebe7bc37928cdb855a8d292a49287e558