A Nash equilibrium based algorithm for mining hidden links in social networks

DOI10.1007/978-3-319-03780-6_13zbMATH Open1339.91099OpenAlexW2223279967MaRDI QIDQ2867115FDOQ2867115

Deying Li, Huan Ma, Lidan Fan, Yuqing Zhu, Zaixin Lu, Weili Wu

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_13

Recommendations

• Mining hidden links in social networks to achieve equilibrium
• Discovering overlapping communities in social networks: a novel game-theoretic approach
• Nash equilibrium of two game models on the random social network
• Framework of regression-based graph matrix analysis approach in multi-relational social network problem
• An algorithm for finding Nash equilibria in dynamic network games

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Approximation algorithms (68W25) Games involving graphs (91A43)

Cites Work

• Emergence of Scaling in Random Networks
• Community structure in social and biological networks
• Evolution of the social network of scientific collaborations
• A new status index derived from sociometric analysis
• Title not available (Why is that?)
• Collective dynamics of ‘small-world’ networks
• Assessing experimentally derived interactions in a small world
• Title not available (Why is that?)
• Network analysis. Methodological foundations.

Cited In (1)

• Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning

This page was built for publication: A Nash equilibrium based algorithm for mining hidden links in social networks

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