Shinohara Rock-Paper-Scissors
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918125413335040 |
|---|---|
| author | Ui, Takashi |
| author_facet | Ui, Takashi |
| contents | This paper analyzes Shinohara Rock-Paper-Scissors (RPS), a variant of the classic RPS game introduced by board game designer Yoshiteru Shinohara. Players compete against a host who always plays rock, so players choose either rock or paper. The twist is that if two or more players choose paper, they are eliminated, and the last remaining player is the winner, creating strategic tension among the players. There exists a unique symmetric subgame perfect equilibrium, in which the probability of choosing paper satisfies the equation $(1-p)^{n-1} + p^{n-1}/n = 1/n$, where $n$ is the number of remaining players. The game also admits a continuum of asymmetric equilibria. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_10132 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Shinohara Rock-Paper-Scissors Ui, Takashi Theoretical Economics This paper analyzes Shinohara Rock-Paper-Scissors (RPS), a variant of the classic RPS game introduced by board game designer Yoshiteru Shinohara. Players compete against a host who always plays rock, so players choose either rock or paper. The twist is that if two or more players choose paper, they are eliminated, and the last remaining player is the winner, creating strategic tension among the players. There exists a unique symmetric subgame perfect equilibrium, in which the probability of choosing paper satisfies the equation $(1-p)^{n-1} + p^{n-1}/n = 1/n$, where $n$ is the number of remaining players. The game also admits a continuum of asymmetric equilibria. |
| title | Shinohara Rock-Paper-Scissors |
| topic | Theoretical Economics |
| url | https://arxiv.org/abs/2503.10132 |