Pure-strategy Nash equilibria on competitive diffusion games

被引：3

作者：

Enomoto, Hikoe ^{[1
]}

Hachimori, Masahiro ^{[2
]}

Nakamura, Shun ^{[2
]}

Shigeno, Maiko ^{[2
]}

Tanaka, Yuya ^{[2
]}

Tsugami, Masaaki ^{[2
]}

机构：

[1] Waseda Univ, Grad Sch Econ, Tokyo 1698050, Japan

[2] Univ Tsukuba, Fac Engn Informat & Syst, Tsukuba, Ibaraki 3058573, Japan

来源：

DISCRETE APPLIED MATHEMATICS | 2018年 / 244卷

关键词：

Games on graphs; Pure Nash equilibrium; Discrete Voronoi game; Information diffusion game; SOCIAL NETWORKS;

D O I：

10.1016/j.dam.2018.03.031

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper treats two types of competitive facility location games on graphs: information diffusion games and discrete Voronoi games. Both of these games can be regarded as models of the rumor spreading processes on the networks, where each player of the game wants to select an influencer who can widely spread information throughout the network. For each game, given a graph and the number of players, we are interested in whether there exist pure Nash equilibria or not. In this paper, we discuss the existence of pure Nash equilibria on graphs with small diameter, path graphs, and cycle graphs. The results include the behavior of the discrete Voronoi games on graphs with diameter two, and the complete characterization of the existence of the pure Nash equilibria in the discrete Voronoi games and information diffusion games on path graphs. (C) 2018 Elsevier B.V. All rights reserved.

引用

页码：1 / 19

页数：19

共 11 条

[1] A note on competitive diffusion through social networks [J].