On stable solutions of the one- and two-sided model matching problems

An algorithm is introduced to determine proper and stable solutions to the model matching problem. It utilizes the theory of inverses and state-space algorithms, and it guarantees a proper and stable solution to the problem when one exists. This approach is also used to determine proper and stable solutions of the two-sided matching problem. Examples are included.<
>