Optimal Targeting in Super-Modular Games
From MaRDI portal
Abstract: 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.
Recommendations
- Estimating supermodular games using rationalizable strategies
- On equilibrium refinements in supermodular games
- scientific article; zbMATH DE number 4029316
- The nonatomic supermodular game
- Efficiency in Multi-objective Games
- On Optimum Target Assignments
- Localization of optimal strategies in certain games
- Abstract interpretation of supermodular games
- Determination of rational strategies for players in two-target games
This page was built for publication: Optimal Targeting in Super-Modular Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053144)