Consider a graph G with n nodes and m edges, which represents a social network, and
assume that initially each node is blue or white. In each round, all nodes simultaneously …

Consider a graph G and suppose that initially each node is colored either black or white. In
the majority model, in each round all nodes simultaneously update their color to the most …

We consider the adaptive influence maximization problem: given a network and a budget k,
iteratively select k seeds in the network to maximize the expected number of adopters. In the …

We study a graph-based generalization of the Galam opinion formation model. Consider a
simple connected graph which represents a social network. Each node in the graph is …

Consider a graph G, which represents a social network, and assume that initially each node
is either blue or white (corresponding to its opinion on a certain topic). In each round, all …

Consider a directed network where each node is either red (using the red product), blue
(using the blue product), or uncolored (undecided). Then in each round, an uncolored node …

We study cascades in social networks with the independent cascade (IC) model and the
Susceptible-Infected-recovered (SIR) model. The well-studied IC model fails to capture the …

The greedy algorithm for monotone submodular function maximization subject to cardinality
constraint is guaranteed to approximate the optimal solution to within a $1-1/e $ factor …

We address the problem of influence maximization within the framework of the linear
threshold model, focusing on its comparison to the independent cascade model. Previous …

In algorithmic game theory, we analyze games and design mechanisms through
computational lens. We prefer mechanisms that are simple, deterministic and incentive …