Self-organizing flows in social networks

DOI10.1007/978-3-319-03578-9_10zbMATH Open1408.91178arXiv1212.0952OpenAlexW2570571741MaRDI QIDQ2868636FDOQ2868636

Authors: Nidhi Hegde, Laurent Massoulié, Laurent Viennot 

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Abstract: Social networks offer users new means of accessing information, essentially relying on "social filtering", i.e. propagation and filtering of information by social contacts. The sheer amount of data flowing in these networks, combined with the limited budget of attention of each user, makes it difficult to ensure that social filtering brings relevant content to the interested users. Our motivation in this paper is to measure to what extent self-organization of the social network results in efficient social filtering. To this end we introduce flow games, a simple abstraction that models network formation under selfish user dynamics, featuring user-specific interests and budget of attention. In the context of homogeneous user interests, we show that selfish dynamics converge to a stable network structure (namely a pure Nash equilibrium) with close-to-optimal information dissemination. We show in contrast, for the more realistic case of heterogeneous interests, that convergence, if it occurs, may lead to information dissemination that can be arbitrarily inefficient, as captured by an unbounded "price of anarchy". Nevertheless the situation differs when users' interests exhibit a particular structure, captured by a metric space with low doubling dimension. In that case, natural autonomous dynamics converge to a stable configuration. Moreover, users obtain all the information of interest to them in the corresponding dissemination, provided their budget of attention is logarithmic in the size of their interest set.

Full work available at URL: https://arxiv.org/abs/1212.0952

Recommendations

• Self-organizing flows in social networks
• A game-theoretic model of attention in social networks
• A game theoretic analysis of network design with socially-aware users
• Basic network creation games with communication interests
• On the effects of heterogeneity on one-way flow network formation

zbMATH Keywords

price of anarchynetwork formationself-organisationbudget of attentionsocial filtering

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Games involving graphs (91A43)

Cites Work

• Algorithmic Game Theory
• A class of games possessing pure-strategy Nash equilibria
• Potential games
• The Price of Stability for Network Design with Fair Cost Allocation
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• A Noncooperative Model of Network Formation
• Social and economic networks.
• The complexity of pure Nash equilibria
• On a network creation game
• Accessing nearby copies of replicated objects in a distributed environment
• Potential functions and the inefficiency of equilibria
• Nearest neighbor queries in metric spaces
• LAND: stretch \((1 + {\epsilon})\) locality-aware networks for DHTs
• Finding nearest neighbors in growth-restricted metrics
• Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
• Bounded budget betweenness centrality game for strategic network formations

Cited In (8)

• Information-sharing in social networks
• Interests diffusion in social networks
• Self-organizing flows in social networks
• Privacy-conscious information diffusion in social networks
• STRUCTURAL PROPERTIES OF CORE–PERIPHERY COMMUNITIES
• Self-organised criticality and emergent hyperbolic networks: blueprint for complexity in social dynamics
• Community structures in information networks for a discrete agent population
• Title not available (Why is that?)

This page was built for publication: Self-organizing flows in social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868636)