On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach

DOI10.1016/j.artint.2014.06.004zbMath1353.91044arXiv1303.2147OpenAlexW2071435255MaRDI QIDQ2510117

Luis E. Ortiz, Mohammad T. Irfan

Publication date: 1 August 2014

Published in: Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityNash equilibriumsocial network analysiscomputational game theoryinfluence in social networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Noncooperative games (91A10) Games involving graphs (91A43)

Related Items

The Polymatrix Gap Conjecture, Diffusion centrality: a paradigm to maximize spread in social networks, The neighborhood role in the linear threshold rank on social networks, Interdependent defense games with applications to internet security at the level of autonomous systems, A new metric to quantify influence of nodes in social networks

Uses Software

• METIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure preserving reductions among convex optimization problems
• Approximation algorithms for combinatorial problems
• Subjectivity and correlation in randomized strategies
• Interdependent security
• Potential games
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Non-cooperative games
• Dynamic models of segregation†
• Statistical mechanics of complex networks
• Threshold models of diffusion and collective behavior
• Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
• Who's Who in Networks. Wanted: The Key Player
• The complexity of pure Nash equilibria
• Correlated Equilibrium as an Expression of Bayesian Rationality
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Minimizing a Submodular Function on a Lattice
• Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality
• Contagion
• Reducibility among Combinatorial Problems
• The Complexity of Computing a Nash Equilibrium
• Competitive contagion in networks