REVIEW 1 cited by
A mathematical model of the Mafia game
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Mafia (also called Werewolf) is a party game. The participants are divided into two competing groups: citizens and a mafia. The objective is to eliminate the opponent group. The game consists of two consecutive phases (day and night) and a certain set of actions (e.g. lynching during day). The mafia members have additional powers (knowing each other, killing during night) whereas the citizens are more numerous. We propose a simple mathematical model of the game, which is essentially a pure death process with discrete time. We find the closed-form solutions for the mafia winning-chance, w(n,m), as well as for the evolution of the game. Moreover, we investigate the discrete properties of results, as well as their continuous-time approximations. It turns out that a relatively small number of the mafia members, i.e. proportional to the square root of the total number of players, gives equal winning-chance for both groups. Furthermore, the game strongly depends on the parity of the total number of players.
Forward citations
Cited by 1 Pith paper
-
Cumulative suspicion and absorption dynamics in an agent-based Mafia game
History-dependent suspicion scores in an agent Mafia model yield F(τ)∼(τ/N)^{N_m} early extinction without detectives and an empirical N_c collapse of win probabilities that detectives break.
Discussion (0). Continue with ORCID to comment.