In the well-studied Colonel Blotto game, players must divide a pool of troops among a set of
battlefields with the goal of winning a majority. Despite the importance of this game, only a …

A signed graph offers richer information than an unsigned graph, since it describes both
collaborative and competitive relationships in social networks. In this paper, we study …

Shifting social opinions has far-reaching implications in various aspects, such as public
health campaigns, product marketing, and political candidates. In this paper, we study a …

We consider the problem of budget allocation for competitive influence maximization over
social networks. In this problem, multiple competing parties (players) want to distribute their …

Recommendation systems usually try to “guess” a user's preferences from the system's view.
We study another side of recommendation: active opinion-formation from the perspective of …

In this work, we consider dynamic influence maximization games over social networks with
multiple players (influencers). At the beginning of each campaign opportunity, individuals' …

We provide a polynomial-time, scalable algorithm for equilibrium computation in multi-agent
influence games on networks, extending work of Bindel, Kleinberg, and Oren (2015) from …

We study competition in a general framework introduced by Immorlica et al. and answer their
main open question. Immorlica et al. considered classic optimization problems in terms of …

We provide a polynomial-time, scalable algorithm for equilibrium computation in multi-agent
influence games on networks, extending work of Bindel, Kleinberg, and Oren (2015) from …

From a perspective of designing or engineering for opinion formation games in social
networks, the opinion maximization (or minimization) problem has been studied mainly for …