Defensive Future Studies

Defensive Future Studies

Application of Two-Person Network-Interdiction Game in Detect Of Enemy

Document Type : Original Article

Authors
Hamid Bigdeli 1
Mehdi Kabiri 2
Javad Tayyebi 3
1 Assistant Prof, Institute for the Study of War, AJA Command and Staff University, Tehran, Iran.
2 Researcher, Institute for the study of war, AJA Command and Staff University
3 Assistant Prof. in Department of Industrial Engineering, Faculty of Industrial and Computer Engineering, Birjand University of Technology, Birjand, Iran.
10.22034/dfsr.2021.527821.1483
Abstract
The aim of this paper is to mathematically model the problem of identifying the enemy traversal path in ground defense. By solving the proposed model, the best solution is given to help the commanders of the ground unit to prevent the transfer of enemy forces and equipment. This can be considered as a subject of a war game involving two players. The first player tries to move his forces towards a specific target, and the second player tries to inspect different areas by aircraft, drones, ground forces, etc. in order to identify the enemy. For this problem which is static bayesian game, a mathematical model based on real-world hypotheses is presented. Due to the complexity of the model, a column generation method is presented to solve the model. Finally, the efficiency of the proposed model and the solution method is evaluated using the simulation of the war between Iraq and Kuwait. The results show that the use of this mathematical approach has a good effect on the optimal use of equipment to identify the enemy.
Keywords
Wargaming
Ground Defense
Interdiction Problem
Two-Person Game

  •  

    • Abdolahzadeh, A., Aman, M., & Tayyebi, J. (2020). Minimum st-cut interdiction problem. Computers & Industrial Engineering, 148, 106708.
    • Ahuja, R. K., Magnanti, T. L., & Flows, J. O. N. (1993). Theory, algorithms, and applications. In Network flows.‏
    • Atamtürk, A., Deck, C., & Jeon, H. (2020). Successive quadratic upper bounding for discrete mean-risk minimization and network interdiction. INFORMS Journal on Computing, 32(2), 346-355.
    • Forghani, A., Dehghanian, F., Salari, M., & Ghiami, Y. (2020). A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities. Computers & Operations Research, 114, 104831.
    • Fulkerson, D. R., & Harding, G. C. (1977). Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming, 13(1), 116-118.‏
    • Gibbons, R. (1997). An introduction to applicable game theory. Journal of Economic Perspectives, 11(1), 127-149.
    • Jabarzare, Z., Zolfagharinia, H., & Najafi, M. (2020). Dynamic interdiction networks with applications in illicit supply chains. Omega, 96, 102069.
    • Kodialam, M., & Lakshman, T. V. (2003, March). Detecting network intrusions via sampling: a game theoretic approach. In IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No. 03CH37428)(Vol. 3, pp. 1880-1889). IEEE.
    • Lim, C., & Smith, J. C. (2007). Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions, 39(1), 15-26.
    • Mohammadi, A., & Tayyebi, J. (2019). Maximum Capacity Path Interdiction Problem with Fixed Costs. Asia-Pacific Journal of Operational Research, 36(04), 1950018.‏
    • Pan, F., Charlton, W. S., & Morton, D. P. (2003). A stochastic program for interdicting smuggled nuclear material. In Network interdiction and stochastic integer programming(pp. 1-19). Springer, Boston, MA.
    • Salmeron, J., Wood, K., & Baldick, R. (2004). Analysis of electric grid security under terrorist threat. IEEE Transactions on power systems, 19(2), 905-912.‏
    • Smith, J. C., & Song, Y. (2020). A survey of network interdiction models and algorithms. European Journal of Operational Research, 283(3), 797-811.
    • Steinrauf, R. L. (1991). Network interdiction models. Naval Postgraduate School Monterey Ca.‏
    • Washburn, A., & Wood, K. (1995). Two-person zero-sum games for network interdiction. Operations research, 43(2), 243-251.
    • Whiteman, P. S. B. (1999). Improving single strike effectiveness for network interdiction. Military Operations Research, 15-30.‏
    • Wood, R. K. (1993). Deterministic network interdiction. Mathematical and Computer Modelling, 17(2), 1-18.‏
    • Wood, R. K. (2010). Bilevel network interdiction models: Formulations and solutions. Wiley encyclopedia of operations research and management science.

    Xiao, K., Zhu, C., Zhang, W., & Wei, X. (2020). The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property. IEEE Access, 8, 146535-146547.‏