Guess 2/3 of the average
Mathematical game From Wikipedia, the free encyclopedia
In game theory, "guess 2/3 of the average" is a game where players simultaneously select a real number between 0 and 100, inclusive. The winner of the game is the player(s) who select a number closest to 2/3 of the average of numbers chosen by all players.[1]
Alain Ledoux is the founding father of the "guess 2/3 of the average" game. In 1981, Ledoux used this game as a tie breaker in his French magazine Jeux et Stratégie. He asked about 4,000 readers, who reached the same number of points in previous puzzles, to state an integer between 1 and 1,000,000,000. The winner was the one who guessed closest to 2/3 of the average guess.[2] Rosemarie Nagel (1995) revealed the potential of guessing games of that kind: They are able to disclose participants' "depth of reasoning."[3]
In this game, there is no strictly dominant strategy, but there are strongly dominated strategies. There is a unique pure strategy Nash equilibrium. This equilibrium can be found by iterated elimination of weakly dominated strategies.[4]
Intuitively, guessing any number higher than 2/3 of what you expect others to guess on average cannot be part of a Nash equilibrium. The highest possible average that would occur if everyone guessed 100 is 66+2/3. Therefore, choosing a number that lies above 66+2/3 is strictly dominated for every player. These guesses can thus be eliminated. Once these strategies are eliminated for every player, 66+2/3 becomes the new highest possible average (that is, if everyone chooses 66+2/3). Therefore, any guess above 44+4/9 is weakly dominated for every player since no player will guess above 66+2/3, and 2/3 of 66+2/3 is 44+4/9. This process will continue as this logic is continually applied, If the same group of people play the game consistently, with each step, the highest possible logical answer keeps getting smaller, the average will move close to 0, all other numbers above 0 have been eliminated. If all players understand this logic and select 0, the game reaches its Nash equilibrium.[5] At this state, every player has chosen to play the best response strategy for themselves, given what everyone else is choosing.
However, this degeneration does not occur in quite the same way if choices are restricted to, for example, the integers between 0 and 1. In this case, all integers except 0 and 1 vanish; it becomes advantageous to select 0 if you expect that at least 1/4 of all players will do so, and select 1 otherwise. (In this way, it is a lopsided version of the so-called "consensus game", where one wins by being in the majority.)[citation needed]
This game illustrates the difference between the perfect rationality of an actor and the common knowledge of the rationality of all players. To achieve its Nash equilibrium of 0, this game requires all players to be perfectly rational, rationality to be common knowledge, and all players to expect everyone else to behave accordingly.[6] Common knowledge means that every player has the same information, and they also know that everyone else knows that, and that everyone else knows that everyone else knows that, and so on, infinitely.[7] Common knowledge of rationality of all players is the reason why the winning guess is 0.
Economic game theorists have modelled this relationship between rationality and the common knowledge of rationality through K-level reasoning. K stands for the number of times a cycle of reasoning is repeated. A Level-k model usually assumes that k-level 0 agents would approach the game naively and make choices distributed uniformly over the range [0, 100]. In accordance with cognitive hierarchy theory, level 1 players select the best responses to level 0 choices, while level 2 players select the best responses to level 1 choices.[8] Level 1 players would assume that everyone else was playing at level 0, responding to an assumed average of 50 in relation to naive play, and thus their guess would be 33 (2/3 of 50). At k-level 2, a player would play more sophisticatedly and assume that all other players are playing at k-level 1, so they would choose 22 (2/3 of 33).[9] Players are presumptively aware of the probability distributions of selections at each higher level. It would take approximately 21 k-levels to reach 0, the Nash equilibrium of the game.
The guessing game depends on three elements: (1) the subject's perceptions of the level 0 would play; (2) the subject's expectations about the cognitive level of other players; and (3) the number of in-game reasoning steps that the subject is capable of completing.[10] Evidence suggest that most people play at k-levels 0 to 3,[11] so you would just have to think one step ahead of that to have a higher chance at winning the game. Therefore, being aware of this logic allow players to adjust their strategy. This means that perfectly rational players playing in such a game should not guess 0 unless they know that the other players are rational as well, and that all players' rationality is common knowledge. If a rational player reasonably believes that other players will not follow the chain of elimination described above, it would be rational for him/her to guess a number above 0 as their best response.
In reality, we can assume that most players are not perfectly rational, and do not have common knowledge of each other's rationality.[12] As a result, they will also expect others to have a bounded rationality and thus guess a number higher than 0.
This game is a common demonstration in game theory classes. It reveals the significant heterogeneity of behaviour.[11] It is unlikely that many people will play rationally according to the Nash equilibrium. This is because the game has no strictly dominant strategy, so it requires players to consider what others will do. For Nash equilibrium to be played, players would need to assume both that everyone else is rational and that there is common knowledge of rationality. However, this is a strong assumption.
Experiments demonstrate that many people make mistakes and do not assume common knowledge of rationality. It has been demonstrated that even economics graduate students do not guess 0.[3] When performed among ordinary people it is usually found that the winner's guess is much higher than 0: the winning value was found to be 33 in a large online competition organized by the Danish newspaper Politiken. 19,196 people participated and the prize was 5000 Danish kroner.[13]
Grosskopf and Nagel’s investigation also revealed that most players do not choose 0 the first time they play this game. Instead, they realise that 0 is the Nash Equilibrium after some repetitions.[14] A study by Nagel reported an average initial choice of around 36. This corresponds to approximately two levels of k-level reasoning.[15]
Kocher and Sutter compared the behaviours between individual and groups in playing this type of game. They observed that while both subjects applied roughly the same level of reasoning, groups learned faster. This demonstrated that repetition enabled a group of individuals to observe others’ behaviour in previous games and correspondingly choose a number that increases their chances of winning the game.[16]
Sbriglia’s investigation also revealed that non-winners often try to imitate winners’ understanding of the game’s structure. Accordingly, other players adopt strategies which are best responses to the imitators’ behaviour instead of to the average level of rationality. This accelerates the attainment of the game’s Nash equilibrium.[6]
Wikiwand in your browser!
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
