1. # 1 / 2 bases + coordination Sacha Bourgeois-Gironde 1. Coordination under cognitive hierarchies

2. outline Session one : Quick outlook of basic GT analysis Introducing CHT / => Applications to behavioral analyses of different games

3. Coordination problems #1: selecting single equilibria among several available (pure coordination games, BoS). Coordination problems #2: heterogeneously bounded cognition among players in presence of one single players (beauty contests, Hotelling games).

4. Laquelle pensez-vous qu’on pense en général être la plus belle? 1 23 456

6. Beauty Contest Game Or, to change the metaphor slightly, professional investment may be likened to those newspaper competitions in which the competitors have to pick out the six prettiest faces from a hundred photographs, the prize being awarded to the competitor whose choice most nearly corresponds to the average preferences of the competitors as a whole; so that each competitor has to pick not those faces which he himself finds prettiest, but those which he thinks likeliest to catch the fancy of the other competitors, all of whom are looking at the problem from the same point of view. It is not a case of choosing those which, to the best of one’s judgment, are really the prettiest, nor even those which average opinion genuinely thinks the prettiest. We have reached the third degree where we devote our intelligences to anticipating what average opinion expects the average opinion to be. And there are some, I believe, who practise the fourth, fifth and higher degrees. Keynes (1936, p. 156)

7. Instructions Choisissez de manière privée un nombre entre 0 et 100. Le vainqueur sera celui ou celle dont le nombre est le plus proche de la moitié de la moyenne de tous les nombres choisis.

8. The Beauty Contest A rational player does not simply choose a random number or her favourite number, nor does she choose a number above 67 (100 x 2/3), since it is dominated by 67. Moreover, if she believes that the other participants are rational as well, she will not pick a number above 100 x 2/3 x 2/3; and if she believes that the others are rational and that they also believe that all are rational, she will not pick a number above 100 x 2/3 x 2/3 x 2/3 and so on, until all numbers are eliminated but zero. The Beauty-contest game is an ideal tool to study whether individuals reason in steps and how many iterated levels subjects actually apply.

9. 1. A quick outlook of basic GT analysis

10. What is a game? : a set of players, descriptions of their information, and a fix order of the sequence of choices by different players / a function mapping players’ choices and information to outcomes. The specification of a game is completed by a payoff function that attaches a numerical value (or utility) to each outcome.

12. Standard analysis => compute an equilibrium point = a set of strategies for each player which are simultaneously best responses to one another (Nash 1950) = = solving simultaneous equations in which each player’s strategy is an input to the other player’s calculation of expected payoff.

13. Stringent epistemic requirements Common prior beliefs about chance events Belief by players that all players are rational Know that their beliefs are common knowledge (KKKKKK….)

14. Think otherwise than purely standard (anticipated by Nash) How equilibrium might arise (behaviorally) => asymptotic ideas: # of players (mass action): populations learn about what others do and adjust their strategies toward optimization. * time, repetition.

78. 2. A Cognitive Hierarchy (CH) Model of Games Camerer, Ho, and Chong (2004) The Quarterly Journal of Economics

79. Motivation  Nash equilibrium and its refinements: Dominant theories in economics for predicting behaviors in competitive situations.  Subjects do not play Nash in many one-shot games.  Behaviors do not converge to Nash with repeated interactions in some games.  Multiplicity problem (e.g., coordination games).  Modeling heterogeneity really matters in games.

80. Main Goals  Provide a behavioral theory to explain and predict behaviors in any one-shot game  Normal-form games (e.g., zero-sum game, p-beauty contest)  Extensive-form games (e.g., centipede)  Provide an empirical alternative to Nash equilibrium (Camerer, Ho, and Chong, QJE, 2004) and backward induction principle (Ho, Camerer, and Chong, 2005)

81. Modeling Principles PrincipleNash CH Strategic Thinking   Best Response   Mutual Consistency 

82. 5 elements to any CH model

83. 1. Distribution of level k types In Camerer, Ho & Chong (2004) the distribution of level k types is assumed to follow a Poisson distribution with a mean value tau. Once the value of tau is chosen, the complete distribution is known. A nice property of a Poisson distribution is that the frequency of a very high level k drops off quickly for higher values of k.

84. 2. A specification of the action of level 0 players Level 0 types are usually assumed to choose strategy equally often (random). What else can we think of?

85. 3.Beliefs of level k players about other players In CH level k players know the correct proportion of lower-level players (but « overconfidence). Alternative models: level k modeling (all other players are level k-1) ECH : no overconfidence.

86. 4. Assessing the expected payoffs based on the beliefs in (3) Each player in a hierarchy can compute the expected payoffs to different strategies Level 1s compute their expeccted payoffs, knowing what levels 0 will do. Level 2s compute their expected payoffs given their guess about what levels 1s and 0s do, and how frequent these level types are, etc.

87. 5. A choice response function based on the expected payoffs in (4). In the simplest case players choose the strategy with the highest expected payoff : the best response. (what else can we imagine?).

88. Example 1: “zero-sum game” Messick(1965), Behavioral Science

89. Nash Prediction: “zero-sum game”

90. CH Prediction: “zero-sum game”

91. Empirical Frequency: “zero-sum game”

92. The Cognitive Hierarchy (CH) Model  People are different and have different decision rules  Modeling heterogeneity (i.e., distribution of types of players). Types of players are denoted by levels 0, 1, 2, 3,…,  Modeling decision rule of each type

93. Modeling Decision Rule  Proportion of k-step is f(k)  Step 0 choose randomly  k-step thinkers know proportions f(0),...f(k-1)  Form beliefs and best-respond based on beliefs  Iterative and no need to solve a fixed point

94. Implications  Poisson distribution with mean and variance =    in 24 beauty contests).

95. Theoretical Implications  Exhibits “increasingly rational expectations”   ∞  Normalized g K (h) approximates f(h) more closely as k  ∞ (i.e., highest level types are “sophisticated” (or "worldly") and earn the most.  ∞  Highest level type actions converge as k  ∞   0  marginal benefit of thinking harder  0

96. Poisson Distribution  f(k) with mean step of thinking  :

99. Theoretical Properties of CH Model  Advantages over Nash equilibrium  Can “solve” multiplicity problem (picks one statistical distribution)  Sensible interpretation of mixed strategies (de facto purification)  Theory:  τ  ∞ converges to Nash equilibrium in (weakly) dominance solvable games

100. Nash: Theory vs. Data

101. CH Model: Theory vs. Data

102. A variety of Beauty Contest games

103. Why is a study of human behavior with this game interesting? clear distinction between bounded rationality and game theoretic solution game with unique game theoretic solution separation of strategic factors from motivational factors (as e.g. fairness, cooperation) pure strategic game (constant some game) behavior can be interpreted and visualized as “pure bounded rationality” “detection” of different levels of reasoning via –iterated best reply –iterated elimination of dominated strategies each single aspect can be found in other games but the combination of all five are not easily met at once in other games

104. First period results with different populations (Nagel 1995, Bosch et al. 2002)

105. Rules, theories, and data for the basic game Rules Choose a number between 0 and 100. The winner is the person whose number is closest to 2/3 times the average of all chosen numbers Main problem: starting point=level 0

106. Iterated best reply model characteristics Not equilibrium model=strategies of players don’t have to be best reply to each other No common knowlegde of rationality requirement Limited reasoning Best reply to own belief (no consistent beliefs) Purely strategic Random behavior is also a strategy Theoretical value plus noise (e.g. 50*p k +/-є,where p is parameter of game and k is level of reasoning) Problem: what is level zero

107. Nagel 1995, Camerer, Ho AER 1998)

109. Models that have been applied/developed with the different beauty contest data sets In the first period: Iterated dominance Iterated best response model = level of reasoning model (typically 1-3 levels) (Nagel, AER 1995; Stahl, GEB 1996; Camerer, Ho AER 1998)) Bayesian reasoning model (Stahl JEBO 1998) Cognitive hierarchy model (Camerer, chung, Ho, QJE 2004): best reply against probability distribution of all lower levels, one parameter to estimate) Mixture models with beta distribution, normal distribution without specifying theoretical values like 50*p (Bosch, Montalvo, Nagel, and Satorra 2005) Behavior over time Directional learning model (Nagel AER,1995) Cournot model (Nagel, AER 1995) Variations of reinforcement model (Stahl, GEB 1996) Rule learning model (Stahl, GEB 1996) Bayesian learning model (Stahl JEBO 1998) Experienced weighted attraction model (Camerer and Ho, Econometric 1999)

110. More Variations

111. Kocher and Sutter: Team (3 members determine a number) vs Individual behavior within the same group

113. Slonim, Experimental Economics 200?

114. Time is money, JEBO, Kocher and Sutter, 2006

115. How to design an experiment to separate two hypotheses? 1.(Many) people don’t play equilibrium because they are confused. 2.(Many) people don’t play equilibrium because doing so (choosing 0) doesn ‟ t win; rather they are cleverly anticipating the behavior of others, with noise.

116. limits Many experiments have shown that participants do not necessarily behave according to equilibrium predictions. Lots of explanations, here are two: –No clue about equilibrium behavior. –A fully rational player might realize what equilibrium behavior looks like, however doubts that all choose it. Doubt about other players' rationality. Belief about other players' doubts about rationality of Co-players Hard to separate observationally, since equilibrium strategies are not in general best replies to non-equilibrium choices of other players.

117. Main results of behavior in the different treatments in the first period: clear distinction between different types of players, heterogeneity clear differences in behavior for different parameters p ( e.g.,½ and 2/3) clear differences for different group sizes (e.g., 3 players vs 15 players ), team vs indiv., experiences vs. non-experienced players low levels of reasoning, between 0 and 3 in most treatments, few equilibrium choices in student groups (thus few types only!) differences between different subject pools (game theorists vs students, newspaper population seems to be a mixture of student group and game theorist group) behavior over time: (slow) convergence towards equilibrium in most treatments differences in convergence for different p and group sizes feedback matters for convergence continuous low level of reasoning

118. The Colonel Blotto Game Imagine you are a colonel in command of an army during wartime. You and the colonel of the enemy’s army each command 120 troops. Your troops will engage the enemy in 6 battles on 6 separate battlefields. It is the night before the battles and each of you must decide how to deploy your forces across the 6 battlefields. In the morning, you will win a battle if the number of troops you have assigned to a particular battlefield is higher than that assigned by your opponent. In the case that you have both allocated the same number of troops to a particular battlefield, the outcome of the battle will be a loss for both of you. Your deployment of troops will face that of each of the other participants in the tournament. Your total score will be the number of battles you win against all the other participants. How will you deploy your 120 troops? Emile Borel 1921 / Ariel Rubinstein 2009