Static Nuel Games with Terminal Payoff
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913915684782080 |
|---|---|
| author | Mastrakoulis, S. Kehagias, Ath. |
| author_facet | Mastrakoulis, S. Kehagias, Ath. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_01681 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Static Nuel Games with Terminal Payoff Mastrakoulis, S. Kehagias, Ath. Discrete Mathematics Computer Science and Game Theory 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. |
| title | Static Nuel Games with Terminal Payoff |
| topic | Discrete Mathematics Computer Science and Game Theory |
| url | https://arxiv.org/abs/2409.01681 |