2024/09/03 by Symeon Mastrakoulis, Mastrakoulis, S., Athanasios Kehagias +1
Earth and Planetary Sciences · Engineering · #Aquatic and Environmental Studies #Computer Science and Game Theory (cs.GT) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Guidance and Control Systems
paper · pdf · doi:10.48550/arxiv.2409.01681
openalex publication_date 2024/09/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we study a variant of the Nuel game (a generalization of the duel) which is played in turns by N players. In each turn a single player must fire at one of the other players and has a certain probability of hitting and killing his target. The players shoot in a fixed sequence and when a player is eliminated, the ``move'' passes to the next surviving player. The winner is the last surviving player. We prove that, for every N≥2, the Nuel has a stationary Nash equilibrium and provide algorithms for its computation.