Self-Organizing Social Networks by Preference Similarity and the Networking Capacity of their Users
Author(s) -
Debora Di Caprio,
Francisco J. SantosArteaga,
Madjid Tavana
Publication year - 2016
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2016.04.241
Subject(s) - computer science , friendship , incentive , preference , similarity (geometry) , social network (sociolinguistics) , social preferences , basis (linear algebra) , social media , world wide web , microeconomics , artificial intelligence , social psychology , psychology , geometry , mathematics , economics , image (mathematics)
Consider the decision faced by the user of a social media site of whether or not to accept a friendship request from another user, given the limited amount of information available before deciding. We formalize the problem by defining the expected utility trade-offs derived from the request and simulate the resulting incentives numerically. These incentives provide the basis on which to build social networks determined by the different expectations and preferences of their users. Social networks are generated using a self-organizing map to cluster the decision makers (DMs) by their friendship acceptance behaviour. This behaviour is determined by the distribution of requesters relative to the preferences of the DMs
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom