Cooperative game theory considers simple games and influence games as essential
classes of games. A simple game can be viewed as a model of voting systems in which a …

The influence maximization problem (IMP) is one of the most important topics in social
network analysis. It consists of finding the smallest seed of users that maximizes the …

In social network analysis, centrality refers to the relevance of actors or nodes within a social
network represented as a graph. Traditional centrality measures are based on topological …

A central problem in network dynamics is understanding how influence spreads through a
social network. This problem can be studied from an optimization approach. The aim is to …

In the domain of network biology, the interactions among heterogeneous genomic and
molecular entities are represented through networks. Link prediction (LP) methodologies are …

We propose the FwLTR and BwLTR, two new centrality measures based on the Linear
Threshold model. In contrast to the Linear Threshold rank (LTR), these measures …

With the development of information networks, information diffusion becomes increasingly
complicated in social networks, and the influence from different neighbors presents …

The influence spread in a social network is an iterative process that can take several steps. It
begins with an activation seed and finishes when the current activation cannot influence …

An influence game is a simple game represented over an influence graph (ie, a labeled,
weighted graph) on which the influence spread phenomenon is exerted. Influence games …

The influence maximization problem (IMP) and the least cost influence problem (LCI) are
two relevant and widely studied problems in social network analysis. The first one consists of …