Complexity of equilibrium in competitive diffusion games on social networks

DOI10.1016/j.automatica.2016.01.063zbMath1414.91071arXiv1403.3881OpenAlexW2284286654MaRDI QIDQ273917

Seyed Rasoul Etesami, Tamer Başar

Publication date: 22 April 2016

Published in: Automatica (Search for Journal in Brave)

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

zbMATH Keywords

NP-hardnesssocial welfarecompetitive diffusion gameErdős-Renyi graphspure-strategy Nash equilibriumsub-modular function

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (11)

Complexity of equilibrium in competitive diffusion games on social networks ⋮ Competitive Diffusion on Weighted Graphs ⋮ Stability structures of conjunctive Boolean networks ⋮ Algebraic formulation and Nash equilibrium of competitive diffusion games ⋮ The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality ⋮ Rumor transmission in online social networks under Nash equilibrium of a psychological decision game ⋮ Almost sure exponential stability of two-strategy evolutionary games with multiplicative noise ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium ⋮ The one-round multi-player discrete Voronoi game on grids and trees ⋮ Multi-Player Diffusion Games on Graph Classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of equilibrium in competitive diffusion games on social networks
• Combinatorial model and bounds for target set selection
• A comment on pure-strategy Nash equilibria in competitive diffusion games
• A note on competitive diffusion through social networks
• Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
• Nash equilibria for competitive information diffusion on trees
• Information diffusion on the iterated local transitivity model of online social networks
• On the Non-progressive Spread of Influence through Social Networks
• Submodularity of Influence in Social Networks: From Local to Global
• Nash Equilibria in Voronoi Games on Graphs
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Opinion Fluctuations and Disagreement in Social Networks
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Message Passing Optimization of Harmonic Influence Centrality
• Competitive contagion in networks
• An algorithm for the blocks and cutnodes of a graph

This page was built for publication: Complexity of equilibrium in competitive diffusion games on social networks