arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.03070cs.GT
收藏

分层图安全博弈

Layered Graph Security Games

Jakub Černý, Chun Kai Ling, Christian Kroer, Garud Iyengar

AI总结:

本文提出分层图安全博弈模型,覆盖追逃、反恐等场景,证明线性效用下多项式时间可解,二元效用难解,并设计增量策略生成与混合整数规划算法高效计算ε-均衡。

摘要:

安全博弈模拟了对抗性现实应用中的战略互动。此类应用通常涉及极其庞大但高度结构化的策略集(例如,在给定图中选择所有巡逻路线的分布)。在本文中,我们使用分层图来表示每个玩家的策略空间,其路径代表指数级大的策略空间。我们的公式不仅涵盖经典的追逃博弈,还包括其他安全博弈,例如模拟反恐和后勤拦截的博弈。我们在两种不同的效用模型下研究两人零和博弈:线性效用和二元效用。我们表明,在线性效用下,纳什均衡可以在多项式时间内计算,而二元效用可能导致即使计算最佳响应在计算上也是难处理的情况。为此,我们提出了一种基于增量策略生成和混合整数线性规划的实际算法。我们通过大量实验表明,我们的算法为许多感兴趣的博弈高效计算ε-均衡。我们发现,与图本身的大小相比,目标值和图结构通常对运行时间有更大的影响。

英文摘要:

Security games model strategic interactions in adversarial real-world applications. Such applications often involve extremely large but highly structured strategy sets (e.g., selecting a distribution over all patrol routes in a given graph). In this paper, we represent each player's strategy space using a layered graph whose paths represent an exponentially large strategy space. Our formulation entails not only classic pursuit-evasion games, but also other security games, such as those modeling anti-terrorism and logistical interdiction. We study two-player zero-sum games under two distinct utility models: linear and binary utilities. We show that under linear utilities, Nash equilibrium can be computed in polynomial time, while binary utilities may lead to situations where even computing a best-response is computationally intractable. To this end, we propose a practical algorithm based on incremental strategy generation and mixed integer linear programs. We show through extensive experiments that our algorithm efficiently computes $ε$-equilibrium for many games of interest. We find that target values and graph structure often have a larger influence on running times as compared to the size of the graph per se.

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

↑