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

DOI10.1007/978-3-319-03780-6_13MaRDI QIDQ2867115zbMATH OpenOpenAlexFDO

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

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 3829300 (Why is no real title available?)
• A new status index derived from sociometric analysis
• Assessing experimentally derived interactions in a small world
• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Emergence of Scaling in Random Networks
• Evolution of the social network of scientific collaborations
• Network analysis. Methodological foundations.

Cited in

(2)

• Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning
• Mining hidden links in social networks to achieve equilibrium

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)