Instability in stable marriage problem: matching unequally numbered men and women (Q1635035): Difference between revisions

Summary: The goal of the stable marriage problem is to match by pair two sets composed by the same number of elements. Due to its widespread applications in the real world, especially the unique importance to the centralized matchmaker, a very large number of questions have been extensively studied in this field. This article considers a generalized form of the stable marriage problem, where different numbers of men and women need to be matched pairwise and the emergence of single men or women is inevitable. Theoretical analysis and numerical simulations confirm that even a small deviation on the number of men and women from the equality condition can have a large impact on the matching solution of the Gale-Shapley algorithm. These results provide insights to many of the real-world applications when matching two sides with an unequal number.