Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2018, Article ID 7409397, 5 pages
https://doi.org/10.1155/2018/7409397
Research Article

Instability in Stable Marriage Problem: Matching Unequally Numbered Men and Women

1Faculty of Computer and Software Engineering, Huaiyin Institute of Technology, Huaian 233003, China
2Department of Physics, University of Fribourg, Fribourg 1700, Switzerland
3Fintech Research Institute, Shanghai University of Finance and Economics, Shanghai 200433, China

Correspondence should be addressed to Rui-Jie Wu; hc.rfinu@uw.eijiur

Received 12 June 2018; Accepted 8 August 2018; Published 5 September 2018

Academic Editor: Claudio Tessone

Copyright © 2018 Gui-Yuan Shi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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.

1. Introduction

The stable marriage problem (SMP) consists in matching men and women by pairs. By extension, this problem can consist in the matching of two groups composed of different elements. For instance, there are extensive applications in college admissions [1], labor markets [2], and many other social systems [3]. The recent advances in Internet technology have introduced the SMP into new applications: assigning a large number of users to internet server [4], matching peers in a P2P network according to preference [5], the resource allocation in 5G networks [6], or the matching mechanism of real-world dating website [7].

Many researchers studied the algorithms and properties on this fascinating and practical problem. The study of the SMP started in 1962 with the Gale-Shapley (G-S) algorithm [1]. This algorithm matches men and women with the guarantee that there is always a stable match for an equal number of men and women [8]. In 2012, the Nobel Prize in Economics was awarded to Lloyd S. Shapley and Alvin E. Roth for “the theory of stable allocations and the practice of market design.” In this algorithm, each man ranks women separately, from his favorite to his least favorite. Then, each man who is still single issues a proposal to the highest woman in his list who has not rejected him yet. The woman then decides to accept or reject him, by retaining only the man who is the most desirable to her. This solution is proved to be one of the stable men-optimal solutions.

Besides mathematicians and computer scientists, statistical physicists are also interested in this issue [9, 10]. Indeed, statistical physics is used to treat the problem with a large number of particles, which is also well-suited to treat the SMP. The mean field theory was applied to calculate satisfaction of both men and women in the stable marriage problem, and it was found that men, who are the active side, were far happier than women [11]. This method can also be used to estimate the number of stable solutions [12, 13]. The replica method used in spin glass was applied to study the global optimal solution in bipartite matching, although this is not a stable solution [1417]. In addition, some interesting varied variations have been studied, such as the impact of matching on the matching of partial information [18, 19], spatial distribution, intrinsic fitness [20], and acceptance threshold [13].

So far, mainstream research has been focusing on the matching of the equal number of the two sides. In fact, however, real-world matching problems are seldom a match of a precisely equal size of two sides. We have seen many examples in daily life, the student admission, job market, the recent “one to one poverty alleviation program” policy promoted by the Chinese government, or even the real application of SMP: the marriage matching on dating website [7]. These problems are mostly matching between different numbers of elements on both sides. We are curious to know whether the original stable solution of the Gale-Shapley algorithm can be applied to these unequal size-matching problems and, if not, how would the stable solution of matching be changed? What is the overall happiness of all agents in the stable solution? Here, in this paper, we extend the stable marriage problem to a generalized stable marriage problem (GSMP), which represents a matching between any given sizes of the two sides. Dzierzawa and Oméro [13] implemented the numerical simulation to test the matching result of men and women, and their simulation shows that in this case, women are far happier than men according to the Gale-Shapley algorithm. This is hugely different from what the original SMP stable solution suggests. This is crucial because it reveals that the Gale-Shapley solution is very sensitive to even the smallest variation in the number of people and actually cannot be directly used to analyze many unequal size-matching problems. We further thoroughly study the stable solution in GSMP, a matching between any number of men and women. We carry out a theoretical analysis of the stable solution for GSMP and obtain the average happiness for men and women for any given population, and the result is in perfect match with the numerical simulations.

2. Methods

We start with the classical scenario with male and females to match pairwise. Here, we assume that everyone knows all people from the opposite gender and that there is a wish list for each person which represents the ranking of all persons from the other gender to her/his preference. Following previous research models [11, 13, 17], a reasonable and simple assumption is that all wish lists are randomly established and irrelevant. We define an energy function for each person, which is equal to the ranking of their eventual partner in their wish list. The lower energy one has, the happier the person is. When , it is the conventional SMP. Here, we extend the SMP to groups with different sizes. When , obviously, there will be some people who will remain single. For these persons, their energy is defined as one worse than the bottom of the wish list; that is to say, the energy is for single men and for women. Since the number of single persons is obvious, the result of the calculation can be simply converted for other definitions. Here, we use Greek letters to represent men and Latin letters to represent women. Their energy is denoted as and for men and women, respectively.

The G-S algorithm runs as follows: unengaged men will continue to send proposals to women, and women keep the one she prefers between the suitor and her provisional partner. The process stops when no man issues proposal again, either all men are engaged or the unengaged men are rejected by everyone. For , this means that all men are engaged. For the case of , men are engaged and the remaining men are still single.

3. Result and Discussion

The stable marriage problem of the equal size of the two sides has been thoroughly studied by many previous researches. For , several studies have proved that in the stable solution of G-S the algorithm, the average energy of men is , and the average energy of women is .

3.1. Matching for
3.1.1. The Average Energy of Men

First, let us consider the situation that the number of women is larger than the number of men . During the process of men proposing to women, we notice the following: (1) the total energy of men is equal to the number of proposals men have already sent. (2) Once a woman is engaged, she will remain engaged (perhaps with different men) forever; that is to say, the number of partners will never decrease.

Now, we focus on the number of matched pairs in the proposing process; when it reaches to , every man has already been assigned to a partner and the proposal process stops. When the number of matched pairs is , there are women who remain unengaged. If one proposal is sent to an engaged woman, no matter the suitor or the woman’s current provisional partner wins, the number of matched pairs will not change. If a proposal is sent to an unengaged woman, which has a probability of , the number of matched pairs will increase to . It is easy to deduce that on average , proposals have to be sent to match one more pair.

Thus, in order to increase the number of matched pairs from to , the expected total number of proposals men have to send is

Hence, the average energy of men when is

3.1.2. The Average Energy of Women

To obtain the average energy of women , let us consider the final stable solution, in which everyone’s partner has been determined. Let us assume a chosen woman who was finally paired with the man ranked in her list, so men who ranked higher than in her list did not issue a proposal to her. According to the ranking of the men in the women’s list, let us denote the men’s energy as follows: . The men who ranked in the top in the woman’s list must have a better partner than the woman, which means the energy of the woman is higher than that of the assigned partners of these men. This is because if the rank of the lady in a certain men’s list is less than the energy value of the man, then he must have already issued a proposal to the woman according to the G-S Algorithm, thus causing a conflict. We can compute the probability of a woman matched with the man ranked in her list:

The energy of the single women is equal to . They did not receive any proposal; the probability is:

Similarly, we use to replace ; then we have

Consider ; we can estimate the average energy of women:

The summation of the series gives

Since we have , approximately is equal to . and also we can see

3.2. Matching for
3.2.1. The Average Energy of Women

While , let us denote the energy of each woman as , and the average of is denoted by .

In the final matching state, all the women are matched but men are left single. The probability of a man being single is ; i.e., he is ranked lower than any of the current partner in women’s lists. In total, we have men who are single, which means the probability of being single is , so we have

Approximately, we use to replace , by taking the logarithm of both sides; we have

3.2.2. The Average Energy of Men

Let us consider the final stable state of matching which we know the exact matching result of everyone. For any chosen man, we denote the energy of women in his list as . Then we have the probability that he was accepted by the woman ranked in his list:

And the probability that he was rejected by all women is (we assume the energy of each single men is )

We can approximate with the mean value , when is large. By averaging over , we obtain: since ; we have

3.3. Numerical Simulations

The simulation result is shown in Figure 1. Without the loss of generality, we fix the number of men equal to 1000 and vary the number of women from 1 to 2000. Under our definition of single’s energy, as our theoretical result predicted, the average energy of men increases in the beginning and almost saturate when reaches around 700. The energy plateau is mainly caused by the fact that we set the energy of single men at . Although other definitions may apply, we choose this definition out of many reasonable ones to make the theoretical analysis easier. It is notable that the average energy is low when is close to 1. It is instructive to many social phenomena. When there are too few women ( close to 1), most men end up single in the matching. But the feeling of happiness, as written by sociologist Ruut Veenhoven [21], “results from comparison” may come from the relative comparison among surroundings, so that the overall happiness which is low may not be a surprising outcome.

Figure 1: The average energy of men and women versus the number of women , where is set to 1000. The result is obtained by averaging over 100 realizations. The dots and their error bars represent the simulations results and the standard deviation, respectively. The solid lines represent our theoretical predictions.

The energies of both men and women have dramatic changes when approaches 1000. The energy of men has a sharp drop in this region while the energy of women experiences a big rise. The energies of the active side and passive side exchange their positions. As increases, the energy of men continues to decrease; at the meantime, the energy of women keeps growing which is natural for the situation that more women compete for a certain number of men. In total, our simulation result verified our previous theoretical analysis.

For many of the actual matching problems, the change in the number of people’s happiness is not as sensitive to the theoretical predictions. This may be due to some intrinsic factors: appearance, test scores, university rankings, work ability, salary level, and so on, which will cause the wish list to become relevant. One of our studies recently [22] reveals that the correlation of the people’s wish lists can significantly reduce the inherent instability of the G-S algorithm in the generalized group size case.

4. Conclusion

In summary, we extend the study of the conventional stable marriage problem to groups with different numbers of persons. This study has a realistic impact because the numbers of matching parties are often different in many scenarios in the real world and the losers of the competition are widespread. For the traditional men- women matching problem, it is widely accepted that the Gale-Shapley algorithm leads to a matching result in which the active side occupies a huge advantage. However, we find that even by reducing only one woman, the men of the active side become obviously disadvantageous, which means that original stable matching solution is super sensitive to changes in the number of matching members.

In this paper, we thoroughly study the matching solution of unequally sized stable marriage problem and provide both a theoretical solution and numerical simulations. These findings help to further understand the structure and properties of the SMP solution; it also sheds a light on the matching process of matchmakers or resource allocators who deal with many of the real bipartite matching problems with scarcity of one side.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare no conflict of interest.

Acknowledgments

We would like to thank Prof. Yi-Cheng Zhang, Alexandre Vidmer, and Wen-Yao Zhang for helpful discussions. This research is supported in part by the Chinese National Natural Science Foundation under grant no. 61602202 and Natural Science Foundation of Jiangsu Province under grant nos. BK20160428 and BK20161302. GYS and YXK acknowledge the support from China Scholarship Council (CSC).

References

  1. D. Gale and L. S. Shapley, “College admissions and the stability of marriage,” The American Mathematical Monthly, vol. 69, no. 1, pp. 9–15, 1962. View at Publisher · View at Google Scholar
  2. A. E. Roth, “The evolution of the labor market for medical interns and residents: a case study in game theory,” Journal of Political Economy, vol. 92, no. 6, pp. 991–1016, 1984. View at Publisher · View at Google Scholar
  3. A. E. Roth and M. A. O. Sotomayor, Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis (No. 18), Cambridge University Press, 1992.
  4. B. M. Maggs and R. K. Sitaraman, “Algorithmic nuggets in content delivery,” ACM SIGCOMM Computer Communication Review, vol. 45, no. 3, pp. 52–66, 2015. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Lebedev, F. Mathieu, L. Viennot, A. T. Gai, J. Reynier, and F. De Montgolfier, “On using matching theory to understand P2P network design,” in INOC 2007, International Network Optimization Conference, Spa, Belgium, 2007.
  6. M. Hasan and E. Hossain, “Distributed resource allocation in 5G cellular networks,” in Towards 5G: Applications, Requirements and Candidate Technologies, pp. 245–269, Wiley, 2015. View at Publisher · View at Google Scholar
  7. G. J. Hitsch, A. Hortaçsu, and D. Ariely, “Matching and sorting in online dating,” American Economic Review, vol. 100, no. 1, pp. 130–163, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. A. E. Roth, “The economics of matching: stability and incentives,” Mathematics of Operations Research, vol. 7, no. 4, pp. 617–628, 1982. View at Publisher · View at Google Scholar
  9. Y.-C. Zhang, “The information economy,” Non-Equilibrium Social Science and Policy, Springer, Cham, 2017. View at Publisher · View at Google Scholar
  10. A. Chakraborti, D. Challet, A. Chatterjee, M. Marsili, Y. C. Zhang, and B. K. Chakrabarti, “Statistical mechanics of competitive resource allocation using agent-based models,” Physics Reports, vol. 552, pp. 1–25, 2015. View at Publisher · View at Google Scholar · View at Scopus
  11. M. J. Oméro, M. Dzierzawa, M. Marsili, and Y. C. Zhang, “Scaling behavior in the stable marriage problem,” Journal de Physique I, vol. 7, no. 12, pp. 1723–1732, 1997. View at Publisher · View at Google Scholar
  12. B. Pittel, “The average number of stable matchings,” SIAM Journal on Discrete Mathematics, vol. 2, no. 4, pp. 530–549, 1989. View at Publisher · View at Google Scholar
  13. M. Dzierzawa and M. J. Oméro, “Statistics of stable marriages,” Physica A: Statistical Mechanics and its Applications, vol. 287, no. 1-2, pp. 321–333, 2000. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Mézard and G. Parisi, “Replicas and optimization,” Journal de Physique Lettres, vol. 46, no. 17, pp. 771–778, 1985. View at Publisher · View at Google Scholar
  15. M. Mézard and G. Parisi, “On the solution of the random link matching problems,” Journal de Physique, vol. 48, no. 9, pp. 1451–1459, 1987. View at Publisher · View at Google Scholar
  16. V. S. Dotsenko, “Exact solution of the random bipartite matching model,” Journal of Physics A: Mathematical and General, vol. 33, no. 10, pp. 2015–2030, 2000. View at Publisher · View at Google Scholar · View at Scopus
  17. G. Y. Shi, Y. X. Kong, H. Liao, and Y. C. Zhang, “Analysis of ground state in random bipartite matching,” Physica A: Statistical Mechanics and its Applications, vol. 444, pp. 397–402, 2016. View at Publisher · View at Google Scholar · View at Scopus
  18. Y. C. Zhang, “Happier world with more information,” Physica A: Statistical Mechanics and its Applications, vol. 299, no. 1-2, pp. 104–120, 2001. View at Publisher · View at Google Scholar · View at Scopus
  19. P. Laureti and Y. C. Zhang, “Matching games with partial information,” Physica A: Statistical Mechanics and its Applications, vol. 324, no. 1-2, pp. 49–65, 2003. View at Publisher · View at Google Scholar · View at Scopus
  20. G. Caldarelli and A. Capocci, “Beauty and distance in the stable marriage problem,” Physica A: Statistical Mechanics and its Applications, vol. 300, no. 1-2, pp. 325–331, 2001. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Veenhoven, “Is happiness relative?” Social Indicators Research, vol. 24, no. 1, pp. 1–34, 1991. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. X. Kong, G. H. Yuan, L. Zhou, R. J. Wu, and G. Y. Shi, “Competition may increase social happiness in bipartite matching problem,” 2018, http://arxiv.org/abs/1805.09088v2.