Stable marriage problem
id:
stable-marriage-problem-167-4648733
title:
Stable marriage problem
text:
In mathematics, economics, and computer science, the stable marriage problem (also 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) which both prefer each other to their current partner und
brand slug:
wiki
category slug:
encyclopedia
description:
Pairing where no unchosen pair prefers each other over their choice
original url:
https://en.wikipedia.org/wiki/Stable_marriage_problem
date created:
2004-05-26T14:09:50Z
date modified:
2024-08-30T05:50:36Z
main entity:
{"identifier":"Q620702","url":"https://www.wikidata.org/entity/Q620702"}
image:
fields total:
13
integrity:
15