Stable marriage problem

Pairing where no unchosen pair prefers each other over their choice

In mathematics, economics, and computer science, the stable marriage 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:

This keyword could refer to multiple things. Here are some suggestions: