Probabilities and the Persistence of Memory in a Bingo-like Carnival Game
Seemingly simple probabilities in the m-player game bingo have never been calculated. These probabilities include expected game length and the expected number of winners on a given turn. The difficulty in probabilistic analysis lies in the subtle interdependence among the m-many bingo game cards in play. In this paper, the game i got it!, a bingo variant, is considered. This variation provides enough weakening of the inter-player dependence to allow probabilistic analysis not possible for traditional bingo. The probability of winning in exactly k turns is calculated for a one-player game. Given a game of m-many players, the expected game length and tie probability are calculated. With these calculations, the game-s interesting payout scheme is considered.
Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1330287Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1171
 D. B. Agard and M. Shackleford, "A new look at the probabilities in bingo,"CollegeMath. J. , vol. 33, no. 4, pp. 301-305, Sep. 2002.
 D. D. Wackerly, W. Mendenhall, and R. L. Schaeffer. Mathematical Statistics with Applications, 6th ed. Pacific Grove, CA: Duxbury, 2001.