×

Match making in complex social networks. (English) Zbl 1433.91116

Summary: Match making is of significant importance in some social systems. People may need to seek for romantic partners, teammates, collaborators, etc. In this paper, we propose a minimalist framework of match making in complex networks. Specially, we adopt a simple model where each individual would greedily seek for making a match with the strongest partner within his/her social connection range. We explore a few matching schemes including greedy mode, roulette wheel selection mode and completely random mode on different networks. We also investigate when social systems become more densely connected, how the match making process would be affected. Our observations show that, in a more densely connected social network, individuals’ efforts for seeking for matches with the strongest partners would be more likely to end up with matching with someone similar to themselves. Meanwhile, the cost of such an approach may be quickly increased. The implications of such observations in real-life systems and open problems are briefly discussed.

MSC:

91D30 Social networks; opinion dynamics
91B68 Matching models

Software:

TIFIM; AlphaGo
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Wikipedia, Matchmaking, 2017, https://en.wikipedia.org/wiki/Matchmaking.
[2] Ariely, D., The Upside of Irrationality: The Unexpected Benefits of Defying Logic at Work and at Home (2010), Harper
[3] Nayak, R.; Zhang, M.; Chen, L., A social matching system for an online dating network: a preliminary study, Proceedings of the 2010 IEEE International Conference on Data Mining Workshops, 352-357 (2010)
[4] Wagner, S. M., Partners for business-to-business service innovation, IEEE Trans. Eng. Manag., 60, 1, 113-123 (2013)
[5] Sleep, C. E.; Lavner, J. A.; Miller, J. D., Do individuals with maladaptive personality traits find these same traits desirable in potential romantic partners?, Pers. Individ. Dif., 119, 317-322 (2017)
[6] Seidman, G.; Roberts, A.; Zeigler-Hill, V., Narcissism and romantic relationship presentation on social media: the role of motivations and partner attractiveness, Pers. Individ. Dif., 149, 21-30 (2019)
[7] Ouytsel, J. V.; Gool, E. V.; Walrave, M.; Ponnet, K.; Peeters, E., Exploring the role of social networking sites within adolescent romantic relationships and dating experiences, Comput. Hum. Behav., 55, 76-86 (2016)
[8] Zytko, D., Enhancing evaluation of potential romantic partners online, Proceedings of the 19th International Conference on Supporting Group Work, GROUP ’16, 517-520 (2016)
[9] 25
[10] Oldham, N.; Verma, K.; Sheth, A.; Hakimpour, F., Semantic WS-agreement partner selection, Proceedings of the 15th International Conference on World Wide Web, WWW ’06, 697-706 (2006)
[11] Yoshitsubaki, K.; Masui, T.; Yasumura, M., Ding-dong: a marriage partner-finding system with social support, Proceedings of the 2013 Conference on Computer Supported Cooperative Work Companion, CSCW ’13, 287-290 (2013)
[12] Jacobson, I.; Spence, I.; Ng, P. W., Agile and SEMAT: perfect partners, Commun. ACM, 56, 11, 53-59 (2013)
[13] Coviello, L.; Franceschetti, M.; McCubbins, M. D.; Paturi, R.; Vattani, A., Human matching behavior in social networks: an algorithmic perspective, PLoS ONE, 7, 8, 1-9 (2012)
[14] Bae, Y.-J.; Cha, J.; Lee, H.; Lee, B.; Baek, S.; Choi, S.; Jang, D., Social networks and inference about unknown events: a case of the match between Google’s Alphago and Sedol Lee, PLoS One, 12, 2, 1-25 (2017)
[15] He, Q.; Wang, X.; Lei, Z.; Huang, M.; Cai, Y.; Ma, L., TiFim: a two-stage iterative framework for influence maximization in social networks, Appl. Math. Comput., 354, 338-352 (2019) · Zbl 1429.91262
[16] Zang, X.; Yamasaki, T.; Aizawa, K.; Nakamoto, T.; Kuwabara, E.; Egami, S.; Fuchida, Y., You will succeed or not? Matching prediction in a marriage consulting service, Proceedings of the 2017 IEEE Third International Conference on Multimedia Big Data (BigMM), 109-116 (2017)
[17] Guner, N.; Kulikova, Y.; Llull, J., Marriage and health: selection, protection, and assortative mating, Eur. Econ. Rev., 104, 138-166 (2018)
[18] Attanasio, O. P.; Kaufmann, K. M., Education choices and returns on the labor and marriage markets: evidence from data on subjective expectations, J. Econ. Behav. Organ., 140, 35-55 (2017)
[19] Special Issue on the Household Economy.
[20] Holzman, R.; Samet, D., Matching of like rank and the size of the core in the marriage problem, Games Econ. Behav., 88, 277-285 (2014) · Zbl 1311.91155
[21] De Oliveira Da Silva, F. E.; Motta, C. L.R.; Santoro, F. M.; De Oliveira, C. E.T., A social matching approach to support team configuration, Proceedings of the 15th International Conference on Groupware: Design, Implementation, and Use, CRIWG’09, 49-64 (2009)
[22] Sugawara, K.; Yu, Y.; Ragsdale, B.; Hara, H.; Kinoshita, T., Design of an agent-based middleware for job matchmaking in teleworking community, Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS ’03, 1128-1129 (2003)
[23] 7-7
[24] Zhang, N.; Lee, Y.; Balan, R. K., Matchmaking game players on public transport, Proceedings of the 2nd Workshop on Mobile Gaming, MobiGames ’15, 31-36 (2015)
[25] Noia, T. D.; Sciascio, E. D.; Donini, F. M.; Mongiello, M., A system for principled matchmaking in an electronic marketplace, Proceedings of the 12th International Conference on World Wide Web, WWW ’03, 321-330 (2003)
[26] Küster, U.; König-Ries, B.; Stern, M.; Klein, M., DIANE: an integrated approach to automated service discovery, matchmaking and composition, Proceedings of the 16th International Conference on World Wide Web, WWW ’07, 1033-1042 (2007)
[27] Abidi, S. S.R.; Daniyal, A.; Mehdi, S. F., Web service matchmaking using a hybrid of signature and specification matching methods, Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Vol. 2, 266-273 (2014)
[28] Dong, Q.; Huang, D., Privacy-preserving matchmaking in geosocial networks with untrusted servers, Proceedings of the 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), 2591-2592 (2017)
[29] Tanimoto, J., Dilemma solving by the coevolution of networks and strategy in a 2 × 2 game, Phys. Rev. E, 76, 21126, 1-20 (2007)
[30] Tanimoto, J., A study of a quadruple co-evolutionary model and its reciprocity phase for various prisoner’s dilemma game, Int. J. Mod. Phys. C, 22, 04, 401-417 (2011)
[31] Tanimoto, J.; Sagara, H., How the indirect reciprocity with co-evolving norm and strategy for 2 × 2 prisoners dilemma game works for emerging cooperation, Physica A, 438, 595-602 (2015) · Zbl 1400.91078
[32] Tanimoto, J., Promotion of cooperation through co-evolution of networks and strategy in a 2 × 2 game, Physica A, 388, 6, 953-960 (2009)
[33] Wikipedia, Erdos-Renyi model, 2017, https://en.wikipedia.org/wiki/Erdos-Renyi_model.
[34] Xu, X.; Liu, F., Continuous-time quantum walks on Erdös-Rényi networks, Phys. Lett. A, 372, 45, 6727-6732 (2008) · Zbl 1227.81106
[35] Barabási, A. L., Scale-free networks: a decade and beyond, Science, 325, 5939, 412-413 (2009) · Zbl 1226.91052
[36] Liu, X.; Ma, G.; Pagilla, P. R.; Ge, S. S., Dynamic output feedback asynchronous control of networked Markovian jump systems, IEEE Trans. Syst. Man Cybern. Syst., 1-11 (2018)
[37] Yu, Y.; Xiao, G., Preliminary study on bit-string modelling of opinion formation in complex networks, 1-5 (2017), arXiv:1703.02222
[38] J. Leskovec, A. Krevl, Stanford Large Network Dataset Collection, 2014, https://snap.stanford.edu/data/.
[39] Yu, Y.; Xiao, G.; Zhou, J.; Wang, Y.; Wang, Z.; Kurths, J.; Schellnhuber, H. J., System crash as dynamics of complex networks, Proc. Natl. Acad. Sci., 113, 42, 11726-11731 (2016) · Zbl 1355.92101
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.