 Match making in complex social networksFubing Mao, Lijia Ma, Qiang He and Gaoxi Xiao Applied Mathematics and Computation, 2020, vol. 371, issue C Abstract: 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. Keywords: Complex network; Match making; Strongest partner; Romantic partner; Social system (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:371:y:2020:i:c:s0096300319309208 DOI: 10.1016/j.amc.2019.124928 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.