On the number of pursuers that guarantees the capture of the evader in the game on the graph of icosahedral edges

  • Abdulla A. Azamov Institute of Mathematics Uzbekistan Academy of Science
  • Абдулла Азамович Азамов Institute of Mathematics Uzbekistan Academy of Science
  • Azamat G. Holboyev Tashkent State Pedagogical University
  • Азамат Холбоев Tashkent State Pedagogical University
DOI: https://doi.org/10.17076/mgta_2024_3_77
Keywords: pursuit problem, evasion problem, pursuers strategy, geometric graph, icosahedron

Abstract

The article is devoted to the study of the change in the optimal number of pursuers when removing one edge in a differential game on graphs. It is shown that when one edge of the icosahedron is removed, two pursuers are sufficient to capture the evader, whereas for the icosahedron itself, this number is 3.

Published
2024-12-03
How to Cite
Azamov, A., Азамов, А., Holboyev, A., & Холбоев, А. (2024). On the number of pursuers that guarantees the capture of the evader in the game on the graph of icosahedral edges. Mathematical Game Theory and Applications, 16(3), 3-13. https://doi.org/10.17076/mgta_2024_3_77
Issue
Vol 16 No 3 (2024): Mathematical game theory and applications
Section
Статьи
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.