# Bingo pricing: a game simulation and evaluation using the derivatives approach

## Author Info

• Antonio Annibali
• Francesco Bellini

## Abstract

The Bingo game is well known and played all over the world. Its main feature is the sequential drawing without repetition of a set of numbers. Each of these numbers is compared to the numbers contained in the boxes printed on the different rows (and columns) of the score-cards owned by the Bingo participants. The winner will be the participant that firstly is able to check all the boxes (numbers) into a row (Line) or into the entire score-card (Bingo). Assuming that the score-card has a predetermined purchase price and that the jackpot is divided into two shares, respectively for the Bingo and the Line winner, it is evident that all the score-cards show the same starting value (initial price). After each drawing, every score-card will have different values (current price(s)) according with its probability to gain the Line and/or the Bingo. This probability depends from the number of checked boxes in the rows of the score-card and from the number of checked boxes in the rows of all the other playing score-cards. The first aim of this paper is to provide the base data structure of the problem and to formalize the needed algorithms for the initial price and current price calculation. The procedure will evaluate the single score-card and/or the whole set of playing score-cards according to the results of the subsequent drawings. In fact, during the game development and after each drawing, it will be possible to know the value of each score-card in order to choose if maintain it or sell it out. The evaluation will work in accordance to the traditional Galilee's method of "the interrupted game jackpot repartition". This approach has been also mentioned by Blaise Pascal and Pierre de Fermat in their mail exchange about the "jackpot problem". More advanced objective of the paper would be the application of the stock exchange techniques for the calculation of the future price of the score-card (and/or of a set of score-cards) that will have some checked numbers after a certain number of future drawings. In the same way will be calculated the value of the right to purchase or sell a score-card (and/or of a set of score-cards) at a pre-determined price (option price). Especially during the prototyping phase, the modelling and the development of these kind of problems need the use of computational environments able to manage structured data and with high calculation skills. The software that meet these requirements are APL, J and Matlab , as for their capability to use nested arrays and for the endogenous parallelism features of the programming environments. In this paper we will show the above mentioned issues through the use of Apl2Win/IBM . The formalisation of the game structure has been made in a general way, in order to foresee particular cases that act differently from the Bingo. In this way it is possible to simulate the traditional game with 90 numbers in the basket, 3 rows per 10 columns score-cards, 15 number for the Bingo and 5 numbers for the Line but already, for example, the Roulette with 37 (or 38) numbers, score-cards with 1 (or more) row and 1 column and Line with just 1 number.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://repec.org/sce2002/bingo.pdf

## Bibliographic Info

Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 2002 with number 131.

as in new window
Length:
Date of revision:
Handle: RePEc:sce:scecf2:131

Contact details of provider:
Web page: http://www.cepremap.cnrs.fr/sce2002.html/

## Related research

Keywords: bingo; options; futures; gambling; market; evaluation;

Find related papers by JEL classification:

• C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
• C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling

## References

No references listed on IDEAS
You can help add them by filling out this form.

## Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

## Corrections

When requesting a correction, please mention this item's handle: RePEc:sce:scecf2:131. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.