DeepAI AI Chat
Log In Sign Up

Optimal Targeting in Super-Modular Games

by   Giacomo Como, et al.

We study an optimal targeting problem for super-modular games with binary actions and finitely many players. The considered problem consists in the selection of a subset of players of minimum size such that, when the actions of these players are forced to a controlled value while the others are left to repeatedly play a best response action, the system will converge to the greatest Nash equilibrium of the game. Our main contributions consist in showing that the problem is NP-complete and in proposing an efficient iterative algorithm with provable convergence properties for its solution. We discuss in detail the special case of network coordination games and its relation with the notion of cohesiveness. Finally, we show with simulations the strength of our approach with respect to naive heuristics based on classical network centrality measures.


page 1

page 2

page 3

page 4


Controlling network coordination games

We study a novel control problem in the context of network coordination ...

Risk-Averse Equilibrium for Games

The term rational has become synonymous with maximizing expected payoff ...

NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Games

We study the complexity of computing a uniform Nash equilibrium on a bim...

On Binary Networked Public Goods Game with Altruism

In the classical Binary Networked Public Goods (BNPG) game, a player can...

Last-iterate Convergence to Trembling-hand Perfect Equilibria

Designing efficient algorithms to find Nash equilibrium (NE) refinements...

Imitation dynamics in population games on community networks

We study the asymptotic behavior of deterministic, continuous-time imita...

Surveillance-Evasion games under uncertainty

Surveillance-Evasion games are continuous path planning problems in whic...