A new algorithm for stable assignments

Abstract

A new algorithm for solving stable assignment problems is presented. By using a weight table, the overall situation of a problem is considered. The algorithm can deal with not only the one-to-one type assignments but also multi-function assignments for both equal and unequal sets. Some examples are given to illustrate the algorithm.

Keywords:

• Stable marriage problem
• multi-function assignment

C.R. Categories:

• G.1.6
• I.6.3