Stable marriage with indifference (nonfiction): Difference between revisions

From Gnomon Chronicles
Jump to navigation Jump to search
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
In [[Mathematics (nonfiction)|mathematics]], economics, and [[Computer science (nonfiction)|computer science]], the '''stable marriage problem''' (also '''stable matching problem''' or '''SMP''') is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element.  
In [[Mathematics (nonfiction)|mathematics]], economics, and [[Computer science (nonfiction)|computer science]], '''Stable marriage with indifference''' is a variant of the [[Stable marriage problem (nonfiction)|stable marriage problem]].


In the classical version of the problem, each person must rank the members of the opposite sex in strict order of preference. However, in a real-world setting, a person may prefer two or more persons as equally favorable partner. Such tied preference is termed as '''stable marriage with indifference'''.
Like in the original problem, the goal is to match all men to all women such that no pair of man and woman who are unmarried to each other, would simultaneously like to leave their present partners and pair with each other instead.
 
In the classic version of the problem, each person must rank the members of the opposite sex in strict order of preference. However, in a real-world setting, a person may prefer two or more persons as equally favorable partner. Such tied preference is termed as indifference.


== Fiction cross-reference ==
== Fiction cross-reference ==
* [[Gnomon algorithm]]
* [[Gnomon  Chronicles]]


== Nonfiction cross-reference ==
== Nonfiction cross-reference ==
* [[Stable marriage problem (nonfiction)]]


External links:
External links:

Latest revision as of 02:32, 14 October 2019

In mathematics, economics, and computer science, Stable marriage with indifference is a variant of the stable marriage problem.

Like in the original problem, the goal is to match all men to all women such that no pair of man and woman who are unmarried to each other, would simultaneously like to leave their present partners and pair with each other instead.

In the classic version of the problem, each person must rank the members of the opposite sex in strict order of preference. However, in a real-world setting, a person may prefer two or more persons as equally favorable partner. Such tied preference is termed as indifference.

Fiction cross-reference

Nonfiction cross-reference

External links: