The puzzling three-player beauty contest game: play 10 to win

Gisèle Umbhauer

Working Papers of BETA from Bureau d'Economie Théorique et Appliquée, UDS, Strasbourg

Abstract: In this paper, we study the 3-player beauty contest game. This 3-player guessing game has the same Nash equilibrium than the usual (large) N-player beauty contest game but it has also nice specific properties. To highlight these properties, we study classroom experiments on 2-player, 3-player and large N-player guessing games, both from a theoretical and behavioral point of view. The spirit of the paper is the spirit of the French newspaper Jeux et Stratégie which, in the early eighties, proposed the beauty contest game to his fun of logic readers. As a matter of facts, we wonder if it is possible to win the 3-player guessing game. So we show that, despite the 3-player beauty contest game has no weakly dominant strategy, it is possible to play it in a way that leads to win with a large probability, provided the parameter a is lower than 0.75. And we argue that playing 10 for a=0.6 ensures a large probability to win.

Keywords: beauty-contest game; 3-player game; guess; nombre d’or; dominance; win area; behavioral heuristic. (search for similar items in EconPapers)
JEL-codes: C72 C9 (search for similar items in EconPapers)
Date: 2023
New Economics Papers: this item is included in nep-exp, nep-gth and nep-spo
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://beta.u-strasbg.fr/WP/2023/2023-16.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ulp:sbbeta:2023-16

Access Statistics for this paper

More papers in Working Papers of BETA from Bureau d'Economie Théorique et Appliquée, UDS, Strasbourg Contact information at EDIRC.
Bibliographic data for series maintained by ( this e-mail address is bad, please contact ).