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

具有特定位置检测能力的检查博弈:用于策略性资源协调的精确与近似算法

Inspection Game with Location-Specific Detection Capabilities: Exact and Approximate Algorithms for Strategic Resource Coordination

H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology(佐治亚理工学院 H. 米尔顿·斯图尔特工业与系统工程学校)

Bastián Bahamondes, Mathieu Dahan

AI总结:

本文研究具有特定位置检测能力的零和检查博弈,提出基于列生成和乘法权重更新的精确与近似算法来计算 Nash 均衡,并在真实天然气网络上验证了性能与可扩展性。

摘要:

我们考虑一个零和检查博弈,其中防御者在关键系统中部署探测器,以检测攻击者发起的多重攻击。我们假设检测是不完美的,每个探测器位置都与在其监控的系统组件集合内检测到攻击的概率相关。防御者(相应地,攻击者)的目标是最小化(相应地,最大化)未检测到攻击的期望数量。为了计算这个大规模零和博弈的 Nash 均衡,我们构建了一个具有少量约束的线性规划,可以通过列生成算法求解。我们为定价问题提供了一个精确的混合整数规划,并利用其超模结构设计了两种高效的方法来计算具有理论保证的近似 Nash 均衡:一种是列生成算法,另一种是乘法权重更新算法,两者均采用近似最优响应。为了应对组合攻击者策略带来的计算挑战,我们的乘法权重更新算法的每次迭代都在非归一化相对熵下计算到边缘攻击概率多面体的投影,为此我们推导了闭式表达式和线性时间算法。在现实世界天然气分配网络上的计算结果说明了我们的解决方案的性能和可扩展性。

英文摘要:

We consider a zero-sum inspection game, in which a defender positions detectors across a critical system to detect multiple attacks caused by an attacker. We assume that detection is imperfect, and each detector location is associated with a probability of detecting attacks within its set of monitored system components. The objective of the defender (resp. attacker) is to minimize (resp. maximize) the expected number of undetected attacks. To compute Nash equilibria for this large-scale zero-sum game, we formulate a linear program with a small number of constraints that can be solved via column generation. We provide an exact mixed-integer program for the pricing problem and leverage its supermodular structure to design two efficient approaches for computing approximate Nash equilibria with theoretical guarantees: A column generation and a multiplicative weights update algorithm, both with approximate best responses. To address the computational challenges posed by combinatorial attacker strategies, each iteration of our multiplicative weights update algorithm computes a projection onto the polytope of marginal attack probabilities under the unnormalized relative entropy, for which we derive a closed-form expression and a linear-time algorithm. Computational results on real-world gas distribution networks illustrate the performance and scalability of our solution approaches.

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

↑