# Mafia: A theoretical study of players and coalitions in a partial information environment

@article{Braverman2008MafiaAT,
title={Mafia: A theoretical study of players and coalitions in a partial information environment},
author={Mark Braverman and Omid Etesami and Elchanan Mossel},
journal={Annals of Applied Probability},
year={2008},
volume={18},
pages={825-846}
}
• Published 2008
• Mathematics
• Annals of Applied Probability
In this paper, we study a game called “Mafia,” in which different players have different types of information, communication and functionality. The players communicate and function in a way that resembles some real-life situations. We consider two types of operations. First, there are operations that follow an open democratic discussion. Second, some subgroups of players who may have different interests make decisions based on their own group interest. A key ingredient here is that the identity… Expand

#### Figures from this paper

A mathematical model of the Mafia game
• P. Migdal
• Computer Science, Mathematics
• ArXiv
• 2010
A simple mathematical model of mafia, which is essentially a pure death process with discrete time, is proposed and 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. Expand
A Theoretical Study of Mafia Games
Mafia can be described as an experiment in human psychology and mass hysteria, or as a game between informed minority and uninformed majority. Focus on a very restricted setting, Mossel et al. [toExpand
Human-Side Strategies in the Werewolf Game Against the Stealth Werewolf Strategy
• Psychology, Computer Science
• Computers and Games
• 2016
The result suggests that the “stealth werewolf” strategy is not a good strategy for werewolf-side players, and suggests that there exist unusual actions in the strategies that result in an $$\varepsilon$$-Nash equilibrium. Expand
Coevolving Strategies in Social-Elimination Games
• Computer Science
• 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing
• 2011
A new formalism for modeling a player that is capable of learning and adapting its strategies to act with the other members of its own group and against those of a conflicting group is described. Expand
A Simulator for Analyzing the Balance of Mafia Game
• Qiong Chang
• Computer Science
• 2020 IEEE International Conference on Artificial Intelligence and Information Systems (ICAIIS)
• 2020
A simulator which can simulate the various of actions more realistically in Mafia Game and adds a weight of credibility to each character, which can change continuously as the game progresses, and make it more clearly to distinguish the identity of each player. Expand
Constructing a Human-like agent for the Werewolf Game using a psychological model based multiple perspectives
A psychological model that considers multiple perspectives to model the play of a human such as inferring the intention of the other side and a “one's self model” that models the role of others as viewed from their own viewpoint are proposed. Expand
AI Wolf Contest - Development of Game AI Using Collective Intelligence -
• Computer Science
• CGW@IJCAI
• 2016
This study specifies the design of an artificial intelligence (AI) player for a communication game called “Are You a Werewolf?” (AI Wolf) and develops a platform for an AI game competition that uses simplified rules to support the development of AIs that can play Werewolf. Expand
Werewolf Game Modeling Using Action Probabilities Based on Play Log Analysis
A non-human agent that can play the werewolf game (i.e., AI wolf) is constructed with aims of creating more advanced intelligence and acquire more advanced communication skills for AI-based systems. Expand
BONUS! Maximizing Surprise
• Zhihuan Huang, Shengwei Xu
• Computer Science
• ArXiv
• 2021
It is shown that the optimal bonus approximately and asymptotically equals to the “expected lead”, the number of points the weaker player will need to come back in expectation, in an interesting special case. Expand
Mafia Game Setting Research Using Game Refinement Measurement
• Computer Science
• ACE
• 2017
This paper explores the game sophistication of a popular party game called Mafia or Werewolf. It focuses on the playing settings, i.e., the number of total players (say N) including citizen, mafiaExpand

#### References

SHOWING 1-10 OF 13 REFERENCES
Handbook of Game Theory with Economic Applications
• Economics
• 1992
Preface (R.J. Aumann, S. Hart). Strategic equilibrium (E. van Damme). Foundations of strategic equilibrium (J. Hillas, E. Kohlberg). Incomplete information (R.J. Aumann, A. Heifetz). Non-zero-sumExpand
Modeling Bounded Rationality
The notion of bounded rationality was initiated in the 1950s by Herbert Simon; only recently has it influenced mainstream economics. In this book, Ariel Rubinstein defines models of boundedExpand
Almost entirely correct mixing with applications to voting
• Computer Science
• CCS '02
• 2002
In order to design an exceptionally efficient mix network, both asymptotically and in real terms, the notion of almost entirely correct mixing is developed, and a new mix network is proposed that is almost entirelycorrect. Expand
Probability: Theory and Examples
This book is an introduction to probability theory covering laws of large numbers, central limit theorems, random walks, martingales, Markov chains, ergodic theorems, and Brownian motion. It is aExpand
Bit commitment using pseudorandomness
• M. Naor
• Mathematics, Computer Science
• Journal of Cryptology
• 2004
We show how a pseudorandom generator can provide a bit-commitment protocol. We also analyze the number of bits communicated when parties commit to many bits simultaneously, and show that theExpand
An introduction to distributed algorithms
A senior undergraduate or graduate level computer science textbook on algorithm design for distributed computer systems.
Software reliability methods
Software reliability is affected by many factors during the life cycle of a software product, from the definition of the product to the operation and maintenance. All the activities within theExpand
Probability : Theory and Examples, 3rd ed
• 2004
Introduction to Distributed Algorithms, 2nd ed
• DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TORONTO TORONTO, ONTARIO CANADA M59 3G4 E-MAIL: mbraverm@cs.toronto.edu O. ETESAMI DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF CALIFORNIA, BERKELEY BERKELEY,
• 2000
Modeling Bounded Rationality, MIT
• 1998