A new algorithm for stable assignment

Abstract

In this paper, we present a new algorithm for solving the stable assignment problem. By using a weight table and weight bipartite graph, 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 assignment problem
• Multi-function assignment
• Weight bipartite graph

C.R. Categories:

• G.1.6
• I.6.3