Optimal Seeding in Large-Scale Super-Modular Network Games
We study optimal seeding problems for binary super-modular network games. The system planner's objective is to design a minimal cost seeding guaranteeing that at least a predefined fraction of the players adopt a certain action in every Nash equilibrium. Since the problem is known to be NP-hard and its exact solution would require full knowledge of the network structure, we focus on approximate so
