Static Nuel Games with Terminal Payoff
S. Mastrakoulis, Ath. Kehagias

TL;DR
This paper analyzes a turn-based multiplayer game called Nuel, establishing the existence of stationary Nash equilibria for any number of players and providing algorithms to compute them.
Contribution
It introduces a variant of the Nuel game with multiple players, proving the existence of stationary Nash equilibria and developing algorithms to find them.
Findings
Existence of stationary Nash equilibria for all N ≥ 2
Algorithms for computing equilibria
Extension of Nuel game theory to multiplayer settings
Abstract
In this paper we study a variant of the Nuel game (a generalization of the duel) which is played in turns by 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 , the Nuel has a stationary Nash equilibrium and provide algorithms for its computation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAquatic and Environmental Studies · Guidance and Control Systems
