Stable marriage with indifference (nonfiction)

In mathematics, economics, and 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 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.

Fiction cross-reference

• Gnomon algorithm
• Gnomon Chronicles

Nonfiction cross-reference

• Stable marriage problem (nonfiction)

External links:

• Stable marriage problem @ Wikipedia