arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.00972cs.GTcs.SYeess.SY
收藏

利用不完全信息下的对抗最优输运理解警力资源分配

Understanding Police Force Resource Allocation using Adversarial Optimal Transport with Incomplete Information

Yinan Hu, Juntao Chen, Quanyan Zhu

AI总结:

针对警力资源分配中恶意节点信息仅被对手掌握的问题,本文将对抗最优输运建模为不完全信息贝叶斯博弈,提出贝叶斯均衡及可实现该均衡的分布式算法,以支持大规模网络应用。

摘要:

对抗最优输运已被证明是一种有用的数学表述,可用于对资源分配问题建模,以在存在会修改数据的对手的情况下最大化运输效率。然而,通常只有对手知道哪些节点是恶意的、哪些不是。本文将寻求对抗最优输运的问题表述为贝叶斯博弈。我们构建了贝叶斯均衡的概念,并设计了一种可实现这些均衡的分布式算法,使我们的模型适用于大规模网络。关键词:博弈论、犯罪控制、Markov博弈。

英文摘要:

Adversarial optimal transport has been proven useful as a mathematical formulation to model resource allocation problems to maximize the efficiency of transportation with an adversary, who modifies the data. It is often the case, however, that only the adversary knows which nodes are malicious and which are not. In this paper we formulate the problem of seeking adversarial optimal transport into Bayesian games. We construct the concept of Bayesian equilibrium and design a distributed algorithm that achieve those equilibria, making our model applicable to large-scale networks. Keywords: game theory, crime control, Markov games

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

↑