Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium

DOI10.1007/978-3-030-38919-2_52zbMath1440.91011OpenAlexW2999144430MaRDI QIDQ3297794

Hirotaka Ono, Naoka Fukuzono, Hironori Kiya, Tesshu Hanaka, Ryogo Yamaguchi

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_52

zbMATH Keywords

Nash equilibriumchordal graphcompetitive diffusion gamealgorithmic game theory

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57) Algorithmic game theory and complexity (91A68)

Related Items (3)

The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality ⋮ Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles ⋮ Existence of pure Nash equilibria in 2-player information diffusion games with strict public preferences

Cites Work

• 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
• Multi-player Diffusion Games on Graph Classes
• Representation of a finite graph by a set of intervals on the real line
• Competitive Diffusion on Weighted Graphs
• A Characterization of Block-Graphs
• Graph Classes: A Survey
• The Competitive Diffusion Game in Classes of Graphs

This page was built for publication: Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium