2000 character limit reached
Understanding Police Force Resource Allocation using Adversarial Optimal Transport with Incomplete Information (2403.00972v1)
Published 1 Mar 2024 in cs.GT, cs.SY, and eess.SY
Abstract: 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
- Gary S Becker. Crime and punishment: An economic approach. In The economic dimensions of crime, pages 13–68. Springer, 1968.
- Streets: game-theoretic traffic patrolling with exploration and exploitation. 2014.
- Security and cooperation in wireless networks: thwarting malicious and selfish behavior in the age of ubiquitous computing. Cambridge University Press, 2007.
- Determining optimal police patrol areas with maximal covering and backup covering location models. Networks and spatial economics, 10(1):125–145, 2010.
- Marco Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. In Advances in neural information processing systems, pages 2292–2300, 2013.
- Isaac Ehrlich. Participation in illegitimate activities: A theoretical and empirical investigation. Journal of political Economy, 81(3):521–565, 1973.
- Quadratically regularized optimal transport on graphs. SIAM Journal on Scientific Computing, 40(4):A1961–A1986, 2018.
- Nash equilibria of packet forwarding strategies in wireless ad hoc networks. IEEE Transactions on Mobile computing, 5(5):463–476, 2006.
- Regularized discrete optimal transport. SIAM Journal on Imaging Sciences, 7(3):1853–1882, 2014a.
- Regularized discrete optimal transport. SIAM Journal on Imaging Sciences, 7(3):1853–1882, 2014b.
- Methods and systems for matching resource requests with cloud computing environments, March 19 2013. US Patent 8,402,139.
- Game theory, 1991. Cambridge, Massachusetts, 393(12):80, 1991.
- Alfred Galichon. Optimal transport methods in economics. Princeton University Press, 2018.
- Fair resource allocation under an unknown jamming attack: a bayesian game. In 2014 IEEE International Workshop on Information Forensics and Security (WIFS), pages 227–232. IEEE, 2014.
- Stochastic optimization for large-scale optimal transport. In Advances in neural information processing systems, pages 3440–3448, 2016.
- Resource allocation and cross-layer control in wireless networks. Now Publishers Inc, 2006.
- John C Harsanyi. Games with incomplete information played by “bayesian” players, i–iii part i. the basic model. Management science, 14(3):159–182, 1967.
- John C Harsanyi. Games with incomplete information played by “bayesian” players part ii. bayesian equilibrium points. Management Science, 14(5):320–334, 1968.
- Probabilistic pursuit-evasion games: A one-step nash approach. In Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No. 00CH37187), volume 3, pages 2272–2277. IEEE, 2000a.
- Probabilistic pursuit-evasion games: A one-step nash approach. In Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No. 00CH37187), volume 3, pages 2272–2277. IEEE, 2000b.
- Distributed interference compensation for wireless networks. IEEE Journal on Selected Areas in Communications, 24(5):1074–1084, 2006.
- Resilient and distributed discrete optimal transport with deceptive adversary: A game-theoretic approach. IEEE Control Systems Letters, 2021a.
- Fair and distributed dynamic optimal transport for resource allocation over networks. In 2021 55th Annual Conference on Information Sciences and Systems (CISS), pages 1–6. IEEE, 2021b.
- Game-theoretic randomization for security patrolling with dynamic execution uncertainty. In AAMAS, pages 207–214, 2013.
- Shizuo Kakutani. A generalization of brouwer’s fixed point theorem. Duke mathematical journal, 8(3):457–459, 1941.
- Leonid Vitalievich Kantorovich. On the translocation of masses. In Dokl. Akad. Nauk. USSR (NS), volume 37, pages 199–201, 1942.
- Game Theory. Cambridge University Press, 2013. doi: 10.1017/CBO9780511794216.
- Potential games. Games and economic behavior, 14(1):124–143, 1996.
- Guards—innovative application of game theory for national airport security. In Twenty-Second International Joint Conference on Artificial Intelligence, 2011.
- Revocation games in ephemeral networks. In Proceedings of the 15th ACM conference on Computer and communications security, pages 199–210, 2008.
- Distributed algorithm for resource allocation problems under persistent attacks. Journal of the Franklin Institute, 357(10):6241–6256, 2020.
- Communication networks: an optimization, control, and stochastic networks perspective. Cambridge University Press, 2013a.
- Communication networks: an optimization, control, and stochastic networks perspective. Cambridge University Press, 2013b.
- Milind Tambe. Security and game theory: algorithms, deployed systems, lessons learned. Cambridge university press, 2011.
- Cédric Villani. Optimal transport: old and new, volume 338. Springer Science & Business Media, 2008.
- Keeping pace with criminals: An extended study of designing patrol allocation against adaptive opportunistic criminals. Games, 7(3):15, 2016a.
- Keeping pace with criminals: An extended study of designing patrol allocation against adaptive opportunistic criminals. Games, 7(3):15, 2016b.
- Consensus-based distributed discrete optimal transport for decentralized resource matching. IEEE Transactions on Signal and Information Processing over Networks, 5(3):511–524, 2019.