# Guess 2/3 of the average

Last updated

In game theory, "guess 2/3 of the average" is a game where several people guess what 2/3 of the average of their guesses will be, and where the numbers are restricted to the real numbers between 0 and 100, inclusive. The winner is the one closest to the 2/3 average.

## Equilibrium analysis

In this game there is no strictly dominant strategy. However, there is a unique pure strategy Nash equilibrium. This equilibrium can be found by iterated elimination of weakly dominated strategies. Guessing any number that lies above 66+2/3 is weakly dominated for every player since it cannot possibly be 2/3 of the average of any guess. These can be eliminated. Once these strategies are eliminated for every player, 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 until all numbers above 0 have been eliminated. All players selecting 0 also happens to be the Pareto optimal solution.

This degeneration does not occur in quite the same way if choices are restricted to, for example, the integers between 0 and 100. In this case, all integers except 0 and 1 vanish; it becomes advantageous to select 0 if one expects that at least 1/4 of all players will do so, and 1 otherwise. (In this way, it is a lopsided version of the so-called "consensus game", where one wins by being in the majority.)

## Experimental results

This game is a common demonstration in game theory classes, where even economics graduate students fail to guess 0. [1] When performed among ordinary people it is usually found that the winner's guess is much higher than 0: 21.6 was the winning value in a large online competition organized by the Danish newspaper Politiken . 19,196 people participated and the prize was 5000 Danish kroner. [2]

## Rationality versus common knowledge of rationality

This game illustrates the difference between perfect rationality of an actor and the common knowledge of rationality of all players. Even 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.

We can suppose that all the players are rational, but they do not have common knowledge of each other's rationality. Even in this case, it is not required that every player guess 0, since they may expect each other to behave irrationally.

## History

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. [3] Rosemarie Nagel (1995) revealed the potential of guessing games of that kind: They are able to disclose participants' "depth of reasoning." Due to the analogy to Keynes's comparison of newspaper beauty contests and stock market investments [4] the guessing game is also known as the Keynesian beauty contest. [5] Rosemarie Nagel's experimental beauty contest became a famous game in experimental economics. The forgotten inventor of this game was unearthed in 2009 during an online beauty contest experiment with chess players provided by the University of Kassel: [6] Alain Ledoux, together with over 6,000 other chess players, participated in that experiment which looked familiar to him. [7] [8]

## Notes

1. Nagel, Rosemarie (1995). "Unraveling in Guessing Games: An Experimental Study". American Economic Review . 85 (5): 1313–26. JSTOR   2950991.
2. Schou, Astrid (22 September 2005). "Gæt-et-tal konkurrence afslører at vi er irrationelle". Politiken (in Danish). Retrieved 29 August 2017. Includes a histogram of the guesses. Note that some of the players guessed close to 100. A large number of players guessed 33.3 (i.e. 2/3 of 50), indicating an assumption that players would guess randomly. A smaller but significant number of players guessed 22.2 (i.e. 2/3 of 33.3), indicating a second iteration of this theory based on an assumption that players would guess 33.3. The final number of 21.6 was slightly below this peak, implying that on average each player iterated their assumption 1.07 times.
3. Ledoux, Alain (1981). "Concours résultats complets. Les victimes se sont plu à jouer le 14 d'atout" [Competition results complete. The victims were pleased to play the trump 14]. Jeux & Stratégie (in French). 10: 10–1.
4. Keynes, John M. (1936). The General Theory of Interest, Employment and Money. London: Macmillan. p. 156.
5. Duffy, John; Nagel, Rosemarie (1997). "On the Robustness of Behaviour in Experimental 'Beauty Contest' Games". The Economic Journal. 107 (445): 1684. doi:10.1111/j.1468-0297.1997.tb00075.x. JSTOR   2957901.
6. Bühren, Christoph; Frank, Björn (2010). "Chess Players Performance Beyond 64 Squares: A Case Study on the Limitations of Cognitive Abilities Transfer" (PDF). MAGKS Joint Discussion Paper Series in Economics. 19-2010.
7. Bühren, Christoph; Frank, Björn; Nagel, Rosemarie (2012). "A Historical Note on the Beauty Contest" (PDF). MAGKS Joint Discussion Paper Series in Economics. 11-2012.
8. Nagel, Rosemarie; Bühren, Christoph; Frank, Björn (2016). "Inspired and inspiring: Hervé Moulin and the discovery of the beauty contest game". Mathematical Social Sciences. 90: 191–207. doi:10.1016/j.mathsocsci.2016.09.001.

## Related Research Articles

Game theory is the study of mathematical models of strategic interaction among rational decision-makers. It has applications in all fields of social science, as well as in logic, systems science and computer science. Originally, it addressed zero-sum games, in which each participant's gains or losses are exactly balanced by those of the other participants. Today, game theory applies to a wide range of behavioral relations, and is now an umbrella term for the science of logical decision making in humans, animals, and computers.

The prisoner's dilemma is a standard example of a game analyzed in game theory that shows why two completely rational individuals might not cooperate, even if it appears that it is in their best interests to do so. It was originally framed by Merrill Flood and Melvin Dresher while working at RAND in 1950. Albert W. Tucker formalized the game with prison sentence rewards and named it "prisoner's dilemma", presenting it as follows:

Two members of a criminal gang are arrested and imprisoned. Each prisoner is in solitary confinement with no means of communicating with the other. The prosecutors lack sufficient evidence to convict the pair on the principal charge, but they have enough to convict both on a lesser charge. Simultaneously, the prosecutors offer each prisoner a bargain. Each prisoner is given the opportunity either to betray the other by testifying that the other committed the crime, or to cooperate with the other by remaining silent. The possible outcomes are:

In economics and game theory, a participant is considered to have superrationality if they have perfect rationality but assume that all other players are superrational too and that a superrational individual will always come up with the same strategy as any other superrational thinker when facing the same problem. Applying this definition, a superrational player playing against a superrational opponent in a prisoner's dilemma will cooperate while a rationally self-interested player would defect.

The ultimatum game is a game that has become a popular instrument of economic experiments. It was first described by Werner Güth, Rolf Schmittberger, and Bernd Schwarze: One player, the proposer, is endowed with a sum of money. The proposer is tasked with splitting it with another player, the responder. Once the proposer communicates their decision, the responder may accept it or reject it. If the responder accepts, the money is split per the proposal; if the responder rejects, both players receive nothing. Both players know in advance the consequences of the responder accepting or rejecting the offer.

In number theory, the integer square root (isqrt) of a positive integer n is the positive integer m which is the greatest integer less than or equal to the square root of n,

In game theory, the centipede game, first introduced by Robert Rosenthal in 1981, is an extensive form game in which two players take turns choosing either to take a slightly larger share of an increasing pot, or to pass the pot to the other player. The payoffs are arranged so that if one passes the pot to one's opponent and the opponent takes the pot on the next round, one receives slightly less than if one had taken the pot on this round. Although the traditional centipede game had a limit of 100 rounds, any game with this structure but a different number of rounds is called a centipede game.

In game theory, a solution concept is a formal rule for predicting how a game will be played. These predictions are called "solutions", and describe which strategies will be adopted by players and, therefore, the result of the game. The most commonly used solution concepts are equilibrium concepts, most famously Nash equilibrium.

The public goods game is a standard of experimental economics. In the basic game, subjects secretly choose how many of their private tokens to put into a public pot. The tokens in this pot are multiplied by a factor and this "public good" payoff is evenly divided among players. Each subject also keeps the tokens they do not contribute.

Backward induction is the process of reasoning backwards in time, from the end of a problem or situation, to determine a sequence of optimal actions. It proceeds by first considering the last time a decision might be made and choosing what to do in any situation at that time. Using this information, one can then determine what to do at the second-to-last time of decision. This process continues backwards until one has determined the best action for every possible situation at every point in time. It was first used by Zermelo in 1913, to prove that chess has pure optimal strategies.

In game theory, strategic dominance occurs when one strategy is better than another strategy for one player, no matter how that player's opponents may play. Many simple games can be solved using dominance. The opposite, intransitivity, occurs in games where one strategy may be better or worse than another strategy for one player, depending on how the player's opponents may play.

Determinacy is a subfield of set theory, a branch of mathematics, that examines the conditions under which one or the other player of a game has a winning strategy, and the consequences of the existence of such strategies. Alternatively and similarly, "determinacy" is the property of a game whereby such a strategy exists.

A Keynesian beauty contest is a concept developed by John Maynard Keynes and introduced in Chapter 12 of his work, The General Theory of Employment, Interest and Money (1936), to explain price fluctuations in equity markets.

In game theory, the traveler's dilemma is a non-zero-sum game in which each player proposes a payoff. The lower of the two proposals wins; the lowball player receives the lowball payoff plus a small bonus, and the highball player receives the same lowball payoff, minus a small penalty. Surprisingly, the Nash equilibrium is for both players to aggressively lowball. The traveler's dilemma is notable in that naive play appears to outperform the Nash equilibrium; this apparent paradox also appears in the centipede game and the finitely-iterated prisoner's dilemma.

Arithmetic dynamics is a field that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, p-adic, and/or algebraic points under repeated application of a polynomial or rational function. A fundamental goal is to describe arithmetic properties in terms of underlying geometric structures.

Alain Ledoux is the inventor 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.

Cognitive hierarchy theory (CHT) is a behavioral model originating in behavioral economics and game theory that attempts to describe human thought processes in strategic games. CHT aims to improve upon the accuracy of predictions made by standard analytic methods, which can deviate considerably from actual experimental outcomes.

Behavioral game theory analyzes interactive strategic decisions and behavior using the methods of game theory, experimental economics, and experimental psychology. Experiments include testing deviations from typical simplifications of economic theory such as the independence axiom and neglect of altruism, fairness, and framing effects. As a research program, the subject is a development of the last three decades. Traditional game theory focuses on mathematical equilibriums, utility maximizing, and rational choice; in contrast, behavioral game theory focuses on choices made by participants in studies and is game theory applied to experiments. Choices studied in behavioral game theory are not always rational and do not always represent the utility maximizing choice.

Hervé Moulin is a French mathematician who is the Donald J. Robertson Chair of Economics at the Adam Smith Business School at the University of Glasgow. He is known for his research contributions in mathematical economics, in particular in the fields of mechanism design, social choice, game theory and fair division. He has written five books and over 100 peer-reviewed articles.

Giorgio Coricelli is professor of economics and psychology at the University of Southern California, specializing in neuroeconomics. Having done his undergraduate studies at La Sapienza in Rome, he then completed his Ph.D. at the Economic Science Laboratory of the University of Arizona studying with Vernon Smith, shortly before Smith received his Nobel Prize in economics in 2002.

Level-k theory is a human behavioral model used in behavioral economics and game theory. It assumes that players in strategic games base their decisions on predictions about the actions of other players. Players can thus be categorized by the depth of their strategic thought. Level-k theory assumes that each player believes that he or she is the most sophisticated person in the game. This has been attributed to many factors, such as "maintenance costs" or simply overconfidence. Players are thus given a classification within level k based on the level of sophistication that a player ascribes to the other competitors. The more naive you assume them to be the lower your classification. This pattern continues for higher-level players, but each player has only a finite depth of reasoning, meaning that individual players have a limit to the depth to which they can reason strategically.