Mafia (party game)
social deduction game

Mafia, also known as Werewolf, is a social deduction game created in 1986 by Dmitry Davidoff, then a psychology student at Moscow State University. The game models a conflict between two groups: an informed minority (the mafiosi or the werewolves) and an uninformed majority (the villagers). At the start of the game, each player is secretly assigned a role affiliated with one of these teams. The game has two alternating phases: first, a night-phase, during which those with night-killing-powers may covertly kill other players, and second, a day-phase, in which all surviving players debate and vote to eliminate a suspect. The game continues until a faction achieves its win condition; for the village, this usually means eliminating the evil minority, while for the minority, this usually means reaching numerical parity with the village and eliminating any rival evil groups.
History
Dimitry Davidoff (Russian: Дми́трий Давы́дов, Dmitry Davydov) is generally acknowledged as the game's creator. He dates the first game of Mafia to spring 1987 at the Psychology Department of Moscow State University, from where it spread to the classrooms, dorms, and summer camps. Davidoff says that he brought Mafia into the Psychology department classrooms for research and it spread (as a meme) from there to dormitories and likely over next summer, through student summer camps. He credits this game-based methodology to pioneering 1920s psychologist Lev Vygotsky and the Turing test. He developed the game to combine psychology research with his duties teaching high school students.
Begin with the source’s own compact description: “Mafia (party game)” is social deduction game. The dossier treats that line as a proposition to test through Mafia, party and game, not as a finished interpretation.
Why this record matters
The phrase “social deduction game” supplies a clear boundary for inquiry. It also exposes the unanswered questions: who defined that boundary, when it became stable and which sources sit outside it.
The citation trail is more important than the brevity of the summary: it shows where individual claims can be examined in context. The source revision retrieved here is dated Sep 15, 2026. The linked authority identifier is Q17265. None of the 1 selected statements returned an explicit reference. The first chronological checks are 1986 and 1987.
The absence of detail may reflect summary conventions rather than a lack of surviving documentation. The source lead contains qualifying language; that uncertainty should survive quotation, summary and reuse. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Mafia (party game)”, its source revision and the description used here.
- Expand the search: follow Mafia (party game) primary sources, Mafia (party game) archive and Mafia research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Mafia (party game)”?
- Which cited source is closest to the event, object or claim?
- What terminology or title could unlock a more precise catalogue search?
Search terms from this dossier
This entry incorporates text from “Mafia (party game)” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.