arXiv:2611.16496 · v1

How to Defeat a Mafia (of Size 1)

首次提交 2026-11-12 17:02

版本更新 2026-11-12 17:02

雷达观测 2026-11-13 14:15

摘要

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$.

作者备注：19 pages, 2 figures