arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.01756cs.CCcs.GTmath.OC
收藏

关于多项式层次中几种加固-干扰博弈的完备性的研究

On the completeness of several fortification-interdiction games in the Polynomial Hierarchy

Università degli Studi di Milano(米兰大学);Université de Montréal(蒙特利尔大学);Università degli Studi di Torino(都灵大学)

Alberto Boggio Tomasaz, Margarida Carvalho, Roberto Cordone, Pierre Hosteins

AI总结:

本文研究了多项式层次中几种加固-干扰博弈的完备性,证明了多个问题在该层次中的完备性,为进一步研究保护-干扰博弈的完备性提供了基础。

摘要:

加固-干扰博弈是三层次对抗博弈,其中两个对手依次行动以保护、破坏并单纯使用一个基础设施以达到特定目的。许多此类博弈已在文献中通过特定算法方法被提出和解决,然而非常少有研究探讨此类加固问题的完备性,以便将其严格定位在多项式层次中。我们澄清了几种著名的加固问题的完备性状态,例如具有单位加固和攻击权重的三层次干扰背包问题、最大流干扰问题和具有加固的最短路径干扰问题、具有单位权重的多级关键节点问题,以及一个已研究的电力网防御规划问题。对于所有这些问题,我们证明了它们的完备性要么属于多项式层次的Σ^p_2类,要么属于Σ^p_3类。我们还证明了具有任意数量保护和干扰轮次和单位加固和攻击权重的多级加固-干扰背包问题的完备性属于多项式层次的任意层次,因此为进一步证明保护-干扰博弈在该层次中的完备性提供了有用的依据。

英文摘要:

Fortification-interdiction games are tri-level adversarial games where two opponents act in succession to protect, disrupt and simply use an infrastructure for a specific purpose. Many such games have been formulated and tackled in the literature through specific algorithmic methods, however very few investigations exist on the completeness of such fortification problems in order to locate them rigorously in the polynomial hierarchy. We clarify the completeness status of several well-known fortification problems, such as the Tri-level Interdiction Knapsack Problem with unit fortification and attack weights, the Max-flow Interdiction Problem and Shortest Path Interdiction Problem with Fortification, the Multi-level Critical Node Problem with unit weights, as well as a well-studied electric grid defence planning problem. For all of these problems, we prove their completeness either for the $Σ^p_2$ or the $Σ^p_3$ class of the polynomial hierarchy. We also prove that the Multi-level Fortification-Interdiction Knapsack Problem with an arbitrary number of protection and interdiction rounds and unit fortification and attack weights is complete for any level of the polynomial hierarchy, therefore providing a useful basis for further attempts at proving the completeness of protection-interdiction games at any level of said hierarchy.

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

↑