On Influence, Stable Behavior, and the Most Influential Individuals in Networks: A Game-Theoretic Approach
Mohammad T. Irfan, Luis E. Ortiz

TL;DR
This paper introduces influence games, a game-theoretic model for influence in networks, providing algorithms to identify influential individuals and analyzing stable outcomes using Nash equilibrium concepts.
Contribution
It develops a formal game-theoretic framework for influence in networks, including algorithms for influence maximization and stability analysis.
Findings
Complexity characterizations of influence game problems
Efficient algorithms for special cases and heuristics for hard cases
Approximation algorithms with guarantees for influence maximization
Abstract
We introduce a new approach to the study of influence in strategic settings where the action of an individual depends on that of others in a network-structured way. We propose \emph{influence games} as a \emph{game-theoretic} model of the behavior of a large but finite networked population. Influence games allow \emph{both} positive and negative \emph{influence factors}, permitting reversals in behavioral choices. We embrace \emph{pure-strategy Nash equilibrium (PSNE)}, an important solution concept in non-cooperative game theory, to formally define the \emph{stable outcomes} of an influence game and to predict potential outcomes without explicitly considering intricate dynamics. We address an important problem in network influence, the identification of the \emph{most influential individuals}, and approach it algorithmically using PSNE computation. \emph{Computationally}, we provide…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
