Stable marriage with indifference (nonfiction)

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

• Gnomon algorithm
• Gnomon Chronicles

Nonfiction cross-reference

• Stable marriage problem (nonfiction)

External links:

• Stable marriage problem @ Wikipedia