TY - GEN

T1 - Competitive diffusion on weighted graphs

AU - Ito, Takehiro

AU - Otachi, Yota

AU - Saitoh, Toshiki

AU - Satoh, Hisayuki

AU - Suzuki, Akira

AU - Uchizawa, Kei

AU - Uehara, Ryuhei

AU - Yamanaka, Katsuhisa

AU - Zhou, Xiao

N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.

PY - 2015

Y1 - 2015

N2 - Consider an undirected and vertex-weighted graph modeling a social network, where the vertices represent individuals, the edges do connections among them, and weights do levels of importance of individuals. In the competitive diffusion game, each of a number of players chooses a vertex as a seed to propagate his/her idea which spreads along the edges in the graph. The objective of every player is to maximize the sum of weights of vertices infected by his/her idea. In this paper, we study a computational problem of asking whether a pure Nash equilibrium exists in a given graph, and present several negative and positive results with regard to graph classes. We first prove that the problem is W[1]-hard when parameterized by the number of players even for unweighted graphs. We also show that the problem is NP-hard even for series-parallel graphs with positive integer weights, and is NP-hard even for forests with arbitrary integer weights. Furthermore, we show that the problem for forests of paths with arbitrary weights is solvable in pseudo-polynomial time; and it is solvable in quadratic time if a given graph is unweighted. We also prove that the problem is solvable in polynomial time for chain graphs, cochain graphs, and threshold graphs with arbitrary integer weights.

AB - Consider an undirected and vertex-weighted graph modeling a social network, where the vertices represent individuals, the edges do connections among them, and weights do levels of importance of individuals. In the competitive diffusion game, each of a number of players chooses a vertex as a seed to propagate his/her idea which spreads along the edges in the graph. The objective of every player is to maximize the sum of weights of vertices infected by his/her idea. In this paper, we study a computational problem of asking whether a pure Nash equilibrium exists in a given graph, and present several negative and positive results with regard to graph classes. We first prove that the problem is W[1]-hard when parameterized by the number of players even for unweighted graphs. We also show that the problem is NP-hard even for series-parallel graphs with positive integer weights, and is NP-hard even for forests with arbitrary integer weights. Furthermore, we show that the problem for forests of paths with arbitrary weights is solvable in pseudo-polynomial time; and it is solvable in quadratic time if a given graph is unweighted. We also prove that the problem is solvable in polynomial time for chain graphs, cochain graphs, and threshold graphs with arbitrary integer weights.

UR - http://www.scopus.com/inward/record.url?scp=84951793058&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84951793058&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-21840-3_35

DO - 10.1007/978-3-319-21840-3_35

M3 - Conference contribution

AN - SCOPUS:84951793058

SN - 9783319218397

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 422

EP - 433

BT - Algorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings

A2 - Dehne, Frank

A2 - Sack, Jorg-Rudiger

A2 - Stege, Ulrike

PB - Springer Verlag

T2 - 14th International Symposium on Algorithms and Data Structures, WADS 2015

Y2 - 5 August 2015 through 7 August 2015

ER -