The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality

DOI10.1016/j.dam.2022.04.025zbMath1498.91089OpenAlexW4285676310MaRDI QIDQ2172410

Naoka Fukuzono, Hironori Kiya, Hirotaka Ono, Tesshu Hanaka

Publication date: 15 September 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.04.025

zbMATH Keywords

split graphchordal graphinterval graphblock graphcompetitive diffusion gamepure Nash equilibrium

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Complexity of equilibrium in competitive diffusion games on social networks
• Pure Nash equilibria of competitive diffusion process on toroidal grid graphs
• A comment on pure-strategy Nash equilibria in competitive diffusion games
• On rigid circuit graphs
• A note on competitive diffusion through social networks
• Characterizations of strongly chordal graphs
• Nash equilibria for competitive information diffusion on trees
• A characterization of clique graphs
• Fuzzy chordal graphs and its properties
• Representation of a finite graph by a set of intervals on the real line
• Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium
• Competitive Diffusion on Weighted Graphs
• A Characterization of Block-Graphs
• Graph Classes: A Survey
• The Competitive Diffusion Game in Classes of Graphs
• Collective dynamics of ‘small-world’ networks
• Multi-Player Diffusion Games on Graph Classes

This page was built for publication: The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality