Two Influence Maximization Games on Graphs Made Temporal

05/12/2021
by   Niclas Boehmer, et al.
0

To address the dynamic nature of real-world networks, we generalize competitive diffusion games and Voronoi games from static to temporal graphs, where edges may appear or disappear over time. This establishes a new direction of studies in the area of graph games, motivated by applications such as influence spreading. As a first step, we investigate the existence of Nash equilibria in competitive diffusion and Voronoi games on different temporal graph classes. Even when restricting our studies to temporal paths and cycles, this turns out to be a challenging undertaking, revealing significant differences between the two games in the temporal setting. Notably, both games are equivalent on static paths and cycles. Our two main technical results are (algorithmic) proofs for the existence of Nash equilibria in temporal competitive diffusion and temporal Voronoi games when the edges are restricted not to disappear over time.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/15/2018

A Bayesian optimization approach to compute the Nash equilibria of potential games using bandit feedback

Computing Nash equilibria for strategic multi-agent systems is challengi...
07/26/2019

A note on the complexity of integer programming games

In this brief note, we prove that the existence of Nash equilibria on in...
05/03/2021

Exploring Diffusion Characteristics that Influence Serious Games Adoption Decisions

In this paper we discuss the diffusion of serious games and present reas...
12/12/2012

Efficient Nash Computation in Large Population Games with Bounded Influence

We introduce a general representation of large-population games in which...
10/25/2019

On positionality of trigger strategies Nash Equilibria in SCAR

We study the positionality of trigger strategies Nash equilibria σ for t...
04/20/2020

Real World Games Look Like Spinning Tops

This paper investigates the geometrical properties of real world games (...
07/12/2018

Computational Complexity of Games and Puzzles

In this thesis, we survey techniques and results from the study of Compl...