Stable matching problem - Wikipedia

In mathematics, economics, and computer science, the stable matching problem [1][2][3] 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: There is an element A of the first matched set which pref

[kmiura]

オモロイ。他にも「ルームメイトマッチング」「病院・入院患者マッチング」などのバリアント。