At work, we had a problem that's similar to the stable marriage problem. We ended up finding another combinatorial optimization problem called the "assignment problem" [0] that fit more closely with our problem. Here's a brief summary of the assignment problem:
Suppose you had people in two groups A and B where each individual in group A wants to pair up with an individual in group B and visa versa. If you can assign a "compatibility score" to each possible pair, then the goal is to find the set of pairs, where a pair consists of an individual from A and an individual from B, that maximizes the sum of the compatibility scores. In other words, the assignment problem is about finding the best 1:1 mapping between groups A and B when given a compatibility score for every possible pair between the groups of individuals.