Work

How to Defeat a Mafia (of Size 1)

Year: 2026
Type: preprint
Abstract: The game "Mafia'' is a social deduction game where $n$ players attempt to uncover a covert coalition of $m$ players among the $n$. Typically, $d=1$ of the non-coalition players are labelled ``Detective'' and have special abilities. Most game-theoretic analysis considers, however, only the variant without a Detective. Once the Detective role is introduced, extremely complex strategies can be employed, for which reason only upper and lower bounds for winning have been established, namely by considering specific strategies. We analyse the case $m=d=1$, providing a first example where an explicit, provably-optimal strategy can be described beyond $d=0$.
Institution: RMIT University
Language: English
Open Access status: green
OpenAlex ID: W7226027473
Cites: 3
Cited by:
Related to: 10