Stable Matching in Structured Networks
Stable matching studies how to pair members of two sets with the objective to achieve a matching that satisfies all participating agents based on their preferences. In this research, we consider the case of matching in a social network where agents are not fully connected. We propose the concept of D-neighbourhood associated with connective costs to investigate the matching quality in four types of well-used networks. A matching algorithm is proposed based on the classical Gale-Shapley algorithm under constraints of network topology. Through experimental studies, we find that the matching outcomes in scale-free networks yield the best average utility with least connective costs comparing to other structured networks. This research provides insights for understanding matching behavior in social networks like marriage, trade, partnership, online social and job search.
KeywordsStable matching Structured networks D-neighbourhood Connective cost
- Kitsak, M., et al.: Betweenness centrality of fractal, nonfractal scale-free model networks, tests on real networks. Phys. Rev. E 75, 056115 (2007)Google Scholar
- Moldovanu, B.: Two-sided matching-A study in game-theoretic modeling and analysis (Book Review). J. Econ. (1992)Google Scholar
- Roth, A.E., Sotomayor, M.A.O.: A Study in Game-theoretic Modeling and Analysis. Cambridge University Press, Cambridge (2006)Google Scholar
- Strogatz, S.H.: Exploring complex networks. Nature 410(2), 24–27 (2001)Google Scholar
- Wang, X., Jiang, Y.: The influence of the randomness on average path length. Adv. Mat. Res. 87(19), 198701 (2011)Google Scholar