Static Nuel Games with Terminal Payoff
<|reference_start|>Static Nuel Games with Terminal Payoff: 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\geq2$, the Nuel has a stationary Nash equilibrium and provide algorithms for its computation.<|reference_end|>
@article{mastrakoulis2024static,
    title={Static Nuel Games with Terminal Payoff},
    author={S. Mastrakoulis and Ath. Kehagias},
    journal={arXiv preprint arXiv:2409.01681},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.01681},
    primaryClass={cs.DM}
}