Skip to main content
Log in

A three-player singled out game

  • Published:
Journal of Statistical Theory and Practice Aims and scope Submit manuscript

Abstract

The three-player singled out game is played in a series of rounds as follows: In each round, a coin is flipped and the result is kept secret. The players A, B, and C, in this order and one at a time, announce their guesses so that the others can hear them. After all players have guessed, the coin is revealed and all players who guessed correctly earn one point; incorrect guesses earn no points. The game continues until a player reaches n points and is declared the winner. For n = 5 and real questions instead of flipped coins, this game was first aired on an MTV show in 1995. We model the decision-making choices for players B and C. We determine Nash equilibria of the game and show that players B and C can always select the equilibrium with maximal payoffs for both of them. We also study the long-term behavior of the game and show that for large n, both B and C will win with probability almost \({1 \over 2}\).

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Addario-Berry, L., and B. A. Reed. 2008. Ballot theorems, old and new. In Horizons of combinatorics, ed. E. Gyõri, G. Katona, G. O. H. Katona, and L. Lovász, 9–35. Springer-Verlag.

  • Alcaraz, F. C., P. Pyatov, and V. Rittenberg. 2008. Density profiles in the raise and peel model with and without a wall; physics and combinatorics. J. Stat. Mechanics Theory Experiment, P01006. doi:10.1088/1742-5468/2008/01/P01006

    Article  Google Scholar 

  • Alcaraz, F. C., V. Rittenberg, and G. Sierra. 2009. Shared information in stationary states of stochastic processes. Phys. Rev. E 80, 030102R.

  • Broom, M., and J. Rychtáˇr. 2013. Game-theoretical models in biology. Boca Raton, FL: CRC Press.

    MATH  Google Scholar 

  • Fishman, J. 1983. Australia II beats Liberty by 1:47. U.S. lead cut to 3–2 Australia II Cuts Cup Deficit to 3–2. New York Times 133(September 22), 22(N) pB19(L).

  • Hilton, P., and J. Pedersen. 1991. Catalan numbers, their generalizations, and their uses. Math. Intelligencer 13, 64–75.

    Article  MathSciNet  Google Scholar 

  • Johanis, M., and J. Rychtář. 2009. On the singled out game. Int. J. Math. Game Theory Algebra, 18(6), 479–488.

    MathSciNet  MATH  Google Scholar 

  • Johanis, M., and J. Rychtář. 2010. An enhanced model of a two player singled out game. J. Stat. Theory Practice., 4(4), 679–697.

    Article  MathSciNet  Google Scholar 

  • Norris, J. R. 1997. Markov chains. Cambridge, UK: Cambridge University Press.

    Book  Google Scholar 

  • Pyatov, P. 2004. Raise and peel models of fluctuating interfaces and combinatorics of Pascal’s hexagon. J. Stat. Mechanics Theory Experiment, P09003. doi:10.1088/1742-5468/2004/09/ P09003

  • Shelton, K. 2005. The singled out game. Math. Magazine, 78, 15–25.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Rychtárˇ.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Johanis, M., Rychtárˇ, J. A three-player singled out game. J Stat Theory Pract 9, 882–895 (2015). https://doi.org/10.1080/15598608.2015.1042174

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1080/15598608.2015.1042174

AMS Subject Classification

Keywords

Navigation