arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.09946cs.GTcs.MAcs.SYeess.SYmath.OC
收藏

超模块对策中的最优目标

Optimal Targeting in Super-Modular Games

Giacomo Como, Stéphane Durand, Fabio Fagnani

摘要:

本文研究了具有二进制行动和多个局中人的超模块对策的最优目标选择问题。所考虑的问题包括在选择的一个子集的球员的最小尺寸,这样,当这些球员的行动被迫到一个控制值,而其他人都留下反复发挥最佳反应的行动,系统将收敛到最大的纳什均衡的游戏。我们的主要贡献在于表明,这个问题是NP-完全的,并提出了一个有效的迭代算法,证明其解决方案的收敛性。我们详细讨论了网络协调博弈的特殊情况及其与凝聚力概念的关系。最后,我们通过模拟展示了我们的方法在基于经典网络中心性度量的朴素算法方面的优势。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑