NASH EQUILIBRIA FOR INFORMATION DIFFUSION GAMES ON WEIGHTED CYCLES AND PATHS

Abstract

The information diffusion game, which is a type of non-cooperative game, models the diffusion process of information in networks for several competitive firms that want to spread their information. Recently, the game on weighted graphs was introduced and pure Nash equilibria for the game were discussed. This paper gives a full characterization of the existence of pure Nash equilibria for the game on weighted cycles and paths according to the number of vertices, the number of players and weight classes.