Skip to main content

Human-Side Strategies in the Werewolf Game Against the Stealth Werewolf Strategy

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10068))

Abstract

The werewolf game contains unique features, such as persuasion and deception, which are not included in games that have been previously studied in AI research. Studying the werewolf game could be one of the next challenging targets for AI research. In this paper, we concentrate on a werewolf-side strategy called the “stealth werewolf” strategy. With this strategy, each of the werewolf-side players behaves like a villager, and the player does not pretend to have a special role. Even though the strategy is thought to be suboptimal, so far this has not been proved. In this paper, we limit the human-side strategies such that the seer reveals his/her role on the first day and the bodyguard never reveals his/her role. So, the advantage of the werewolves in determining the player to be eliminated by vote is nullified. We calculated the \(\varepsilon \)-Nash equilibrium of strategies for both sides under this limitation. The solution shows that the winning rates of the human-side are more than half when the number of werewolves is assigned as in common play. Since it is thought to be fair and interesting for the winning rate to stay near 50%, the result suggests that the “stealth werewolf” strategy is not a good strategy for werewolf-side players. Furthermore, the result also suggests that there exist unusual actions in the strategies that result in an \(\varepsilon \)-Nash equilibrium.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Some variants of the werewolf game have third-side players. This paper does not treat these variants.

  2. 2.

    As mentioned above, if the number of human-side players fail to excceed the one of werewolves, the game has already ended with werewolves’ victory.

  3. 3.

    The programs and outputs are available at https://github.com/u-tokyo-gps-tanaka-lab/gpw2015.

  4. 4.

    The exploitabilities of the strategies are computed, and the values are less than \(3 \times 10^{-3}\).

  5. 5.

    As mentioned in [5], the average of strategies calculated in every loop gives \(\varepsilon \)-Nash equilibrium.

References

  1. Braverman, M., Etesami, O., Mossel, E.: Mafia: a theoretical study of players and coalitions in a partial information environment. Ann. Appl. Probab. 18, 825–846 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Katagami, D., Takaku, S., Inaba, M., Osawa, H., Shinoda, K., Nishino, J., Toriumi, F.: Investigation of the effects of nonverbal information on werewolf. In: 2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE (2014)

    Google Scholar 

  3. Katagami, D., Kobayashi, Y., Osawa, H., Inaba, M., Shinoda, K., Toriumi, F.: Development of werewolf match system for human players mediated with lifelike agents. In: Proceedings of the Second International Conference on Human-Agent Interaction. ACM (2014)

    Google Scholar 

  4. Katagami, D., Kanazawa, M., Toriumi, F., Osawa, H., Inaba, M., Shinoda, K.: Movement design of a life-like agent for the werewolf game. In: 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE (2015)

    Google Scholar 

  5. Bowling, M., Burch, N., Johanson, M., Tammelin, O.: Heads-up limit hold’em poker is solved. Science 347, 145–149 (2015)

    Article  Google Scholar 

  6. Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: NIPS-20, pp. 905–912 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoheng Bi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Bi, X., Tanaka, T. (2016). Human-Side Strategies in the Werewolf Game Against the Stealth Werewolf Strategy. In: Plaat, A., Kosters, W., van den Herik, J. (eds) Computers and Games. CG 2016. Lecture Notes in Computer Science(), vol 10068. Springer, Cham. https://doi.org/10.1007/978-3-319-50935-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50935-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50934-1

  • Online ISBN: 978-3-319-50935-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics