1 Teck-Hua Ho CH Model April 4, 2004 Outline  In-class Experiment and Examples  Empirical Alternative I: Model of Cognitive Hierarchy (Camerer, Ho, and.

Slides:



Advertisements
Similar presentations
Nagel: Unraveling in Guessing Games: An Experimental Study Economics 328 Spring 2005.
Advertisements

Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
1 University of Michigan, Ann Arbor A Cognitive Hierarchy (CH) Model of Games.
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
Federal Communications Commission NSMA Spectrum Management Conference May 20, 2008 Market Based Forces and the Radio Spectrum By Mark Bykowsky, Kenneth.
Behavioral game theory* Colin F. Camerer, Caltech Behavioral game theory: –How people actually play games –Uses concepts from psychology.
Game Theoretical Insights in Strategic Patrolling: Model and Analysis Nicola Gatti – DEI, Politecnico di Milano, Piazza Leonardo.
Tacit Coordination Games, Strategic Uncertainty, and Coordination Failure John B. Van Huyck, Raymond C. Battalio, Richard O. Beil The American Economic.
Calibrated Learning and Correlated Equilibrium By: Dean Foster and Rakesh Vohra Presented by: Jason Sorensen.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Learning in games Vincent Conitzer
Learning and teaching in games: Statistical models of human play in experiments Colin F. Camerer, Social Sciences Caltech Teck.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
# 1 / 2 bases + coordination Sacha Bourgeois-Gironde 1. Coordination under cognitive hierarchies.
1 Duke PhD Summer Camp August 2007 Outline  Motivation  Mutual Consistency: CH Model  Noisy Best-Response: QRE Model  Instant Convergence: EWA Learning.
Algoritmi per Sistemi Distribuiti Strategici
Intro to Game Theory Revisiting the territory we have covered.
1 Teck H. Ho April 8, 2004 Outline  In-Class Experiment and Motivation  Adaptive Experience-Weighted Attraction (EWA) Learning in Games: Camerer and.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
1 Teck H. Ho Duke PhD Summer CampAugust 2007 Outline  Motivation  Mutual Consistency: CH Model  Noisy Best-Response: QRE Model  Instant Convergence:
1 Teck-Hua Ho CH Model March – June, 2003 A Cognitive Hierarchy Theory of One-Shot Games Teck H. Ho Haas School of Business University of California, Berkeley.
6/2/2001 Cooperative Agent Systems: Artificial Agents Play the Ultimatum Game Steven O. Kimbrough Presented at FMEC 2001, Oslo Joint work with Fang Zhong.
1 University of Michigan, Ann Arbor Teck H. Ho A Cognitive Hierarchy (CH) Model of Games Teck H. Ho Haas School of Business University of California, Berkeley.
Outline  In-Class Experiment on Centipede Game  Test of Iterative Dominance Principle I: McKelvey and Palfrey (1992)  Test of Iterative Dominance Principle.
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
1 Teck-Hua Ho CH Model April 15, 2004 A Cognitive Hierarchy Model of One-Shot Games Teck H. Ho Haas School of Business University of California, Berkeley.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
1 Teck H. Ho April 8, 2004 Outline  In-Class Experiment and Motivation  Adaptive Experience-Weighted Attraction (EWA) Learning in Games: Camerer and.
1 Duke Doctoral Summer Camp August, 2007 Behavioral Game Theory Teck H. Ho University of California, Berkeley.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Outline  Motivation and Modeling Philosophy  Empirical Alternative I: Model of Cognitive Hierarchy (Camerer, Ho, and Chong, QJE, 2004)  Empirical Alternative.
Rationality and information in games Jürgen Jost TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A A A AAA Max Planck.
1 Teck-Hua Ho CH Model April 4, 2004 Outline  In-class Experiment and Examples  Empirical Alternative I: Model of Cognitive Hierarchy (Camerer, Ho, and.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Teck H. Ho 1 Peer-induced Fairness in Games Teck H. Ho University of California, Berkeley (Joint Work with Xuanming Su) October, 2009.
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Quantal Response Equilibrium APEC 8205: Applied Game Theory Fall 2007.
Outline  In-Class Experiment on Centipede Game  Test of Iterative Dominance Principle I: McKelvey and Palfrey (1992)  Test of Iterative Dominance Principle.
1 Teck H. Ho Spring 2006 A Cognitive Hierarchy (CH) Model of Games Teck H. Ho Haas School of Business University of California, Berkeley Joint work with.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
1 Raising Revenue With Raffles: Evidence from a Laboratory Experiment Wooyoung Lim, University of Pittsburgh Alexander Matros, University of Pittsburgh.
Outline  Motivation and Modeling Philosophy  Empirical Alternative I: Model of Cognitive Hierarchy (Camerer, Ho, and Chong, QJE, 2004)  Empirical Alternative.
January 29, 2004 Experimental Economics 1 Outline  In-class experiment on IPV First-Price Auctions  Data from Cox, Robertson, and Smith (1982)  Glenn.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
A Dynamic Level-k Model in Games Teck Ho and Xuanming Su UC Berkeley April 2011 Teck Hua Ho 1.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
The Agencies Method for Coalition Formation in Experimental Games John Nash (University of Princeton) Rosemarie Nagel (Universitat Pompeu Fabra, ICREA,
CPS Learning in games Vincent Conitzer
1 A unified approach to comparative statics puzzles in experiments Armin Schmutzler University of Zurich, CEPR, ENCORE.
Game theory & Linear Programming Steve Gu Mar 28, 2008.
Experimental Economics NSF short course David Laibson August 11, 2005.
Data Analysis Econ 176, Fall Populations When we run an experiment, we are always measuring an outcome, x. We say that an outcome belongs to some.
(Non) Equilibrium Selection, Similarity Judgments and the “Nothing to Gain / Nothing to Lose” Effect Jonathan W. Leland The National Science Foundation*
Part 3 Linear Programming
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
1. 2 You should know by now… u The security level of a strategy for a player is the minimum payoff regardless of what strategy his opponent uses. u A.
Coordination and Learning in Dynamic Global Games: Experimental Evidence Olga Shurchkov MIT The Economic Science Association World Meeting 2007.
Vincent Conitzer CPS Learning in games Vincent Conitzer
UNSW | BUSINESS SCHOOL | SCHOOL OF ECONOMICS Calling the shots Experimental evidence on significant aversion to non-existing strategic risk Ben Greiner.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 0.Game Theory – Brief Introduction Lecture
Replicator Dynamics. Nash makes sense (arguably) if… -Uber-rational -Calculating.
Lec 23 Chapter 28 Game Theory.
GAME THEORY.
Behavioral game theory* Colin F. Camerer, Caltech
Game Theory Fall Mike Shor Topic 3.
CASE − Cognitive Agents for Social Environments
Session 2: Experimental and Behavioral Game Theory
Volume 24, Issue 18, Pages R867-R871 (September 2014)
M9302 Mathematical Models in Economics
Presentation transcript:

1 Teck-Hua Ho CH Model April 4, 2004 Outline  In-class Experiment and Examples  Empirical Alternative I: Model of Cognitive Hierarchy (Camerer, Ho, and Chong, QJE, 2004)  Empirical Alternative II: Quantal Response Equilibrium (McKelvey and Palfrey, GEB, 1995)  Empirical Alternative III: Model of Noisy Introspection (Goeree and Holt, AER, 2001)

2 Teck-Hua Ho CH Model April 4, 2004 Example 1:  Consider the game in which two players independently and simultaneously choose integer numbers between and including 180 and 300. Both players are paid the lower of the two numbers, and, in addition, an amount R > 1 is transferred from the player with the higher number to the player with the lower number.  R = 5 versus R = 180

3 Teck-Hua Ho CH Model April 4, 2004 Example 1:

4 Teck-Hua Ho CH Model April 4, 2004 Example 2:  Consider a symmetric matching pennies game in which the row player chooses between Top and Bottom and the column player simultaneously chooses between Left and Right, as shown below:

5 Teck-Hua Ho CH Model April 4, 2004 Example 2:

6 Teck-Hua Ho CH Model April 4, 2004 Example 3:  The two players choose “effort” levels simultaneously, and the payoff of each player is given by  i = min (e 1, e 2 ) – c x e i  Efforts are integer from 110 to 170.  C = 0.1 or 0.9.

7 Teck-Hua Ho CH Model April 4, 2004 Example 3:

8 Teck-Hua Ho CH Model April 4, 2004 Motivation  Nash equilibrium and its refinements: Dominant theories in economics for predicting behaviors in games.  Subjects in experiments do not play Nash in most one- shot games and in some repeated games (i.e., behavior do not converge to Nash).  Multiplicity problem (e.g., coordination games).  Modeling heterogeneity really matters in games.

9 Teck-Hua Ho CH Model April 4, 2004 First-Shot Games  The FCC license auctions, elections, military campaigns, legal disputes  Many IO models and simple game experiments  Initial conditions for learning

10 Teck-Hua Ho CH Model April 4, 2004 Behavioral Game Theory  How to model bounded rationality (one-shot game)?  Cognitive Hierarchy (CH) model (Camerer, Ho, and Chong, QJE, 2004)  How to model equilibration?  EWA learning model (Camerer and Ho, Econometrica, 1999; Ho, Camerer, and Chong, 2003)  How to model repeated game behavior?  Teaching model (Camerer, Ho, and Chong, JET, 2002) Next Week

11 Teck-Hua Ho CH Model April 4, 2004 Modeling Principles PrincipleNash CH QRE NI Strategic Thinking     Best Response   Mutual Consistency  

12 Teck-Hua Ho CH Model April 4, 2004 Modeling Philosophy General(Game Theory) Precise(Game Theory) Empirically disciplined(Experimental Econ) “the empirical background of economic science is definitely inadequate...it would have been absurd in physics to expect Kepler and Newton without Tycho Brahe” (von Neumann & Morgenstern ‘44) “Without having a broad set of facts on which to theorize, there is a certain danger of spending too much time on models that are mathematically elegant, yet have little connection to actual behavior. At present our empirical knowledge is inadequate...” (Eric Van Damme ‘95)

13 Teck-Hua Ho CH Model April 4, 2004 Outline  In-class Experiment and Examples  Empirical Alternative I: Model of Cognitive Hierarchy (Camerer, Ho, and Chong, QJE, 2004)  Empirical Alternative II: Quantal Response Equilibrium (McKelvey and Palfrey, GEB, 1995)  Empirical Alternative III: Model of Noisy Introspection (Goeree and Holt, AER, 2001)

14 Teck-Hua Ho CH Model April 4, 2004 Example 1: “zero-sum game” Messick(1965), Behavioral Science

15 Teck-Hua Ho CH Model April 4, 2004 Nash Prediction: “zero-sum game”

16 Teck-Hua Ho CH Model April 4, 2004 CH Prediction: “zero-sum game”

17 Teck-Hua Ho CH Model April 4, 2004 Empirical Frequency: “zero-sum game”

18 Teck-Hua Ho CH Model April 4, 2004 The Cognitive Hierarchy (CH) Model  People are different and have different decision rules  Modeling heterogeneity (i.e., distribution of types of players)  Modeling decision rule of each type  Guided by modeling philosophy (general, precise, and empirically disciplined)

19 Teck-Hua Ho CH Model April 4, 2004 Modeling Decision Rule  f(0) step 0 choose randomly  f(k) k-step thinkers know proportions f(0),...f(k-1)  Normalize and best-respond

20 Teck-Hua Ho CH Model April 4, 2004Implications  Exhibits “increasingly rational expectations”  Normalized g(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  ∞  marginal benefit of thinking harder  0

21 Teck-Hua Ho CH Model April 4, 2004 Alternative Specifications  Overconfidence:  k-steps think others are all one step lower (k-1) (Stahl, GEB, 1995; Nagel, AER, 1995; Ho, Camerer and Weigelt, AER, 1998)  “Increasingly irrational expectations” as K  ∞  Has some odd properties (e.g., cycles in entry games)  Self-conscious:  k-steps think there are other k-step thinkers  Similar to Quantal Response Equilibrium/Nash  Fits worse

22 Teck-Hua Ho CH Model April 4, 2004 Modeling Heterogeneity, f(k)  A1:  sharp drop-off due to increasing working memory constraint  A2: f(1) is the mode  A3: f(0)=f(2) (partial symmetry)  A4: f(0) + f(1) = 2f(2)

23 Teck-Hua Ho CH Model April 4, 2004 Implications  A1  Poisson distribution with mean and variance =   A1,A2  Poisson distribution, 1<   A1,A3  Poisson,    )  Poisson,  golden ratio Φ)

24 Teck-Hua Ho CH Model April 4, 2004 Poisson Distribution  f(k) with mean step of thinking  :

25 Teck-Hua Ho CH Model April 4, 2004 Example 1: “zero-sum game”

26 Teck-Hua Ho CH Model April 4, 2004 Historical Roots  “Fictitious play” as an algorithm for computing Nash equilibrium (Brown, 1951; Robinson, 1951)  In our terminology, the fictitious play model is equivalent to one in which f(k) = 1/N for N steps of thinking and N  ∞  Instead of a single player iterating repeatedly until a fixed point is reached and taking the player’s earlier tentative decisions as pseudo-data, we posit a population of players in which a fraction f(k) stop after k-steps of thinking

27 Teck-Hua Ho CH Model April 4, 2004 Theoretical Properties of CH Model  Advantages over Nash equilibrium  Can “solve” multiplicity problem (picks one statistical distribution)  Solves refinement problems (all moves occur in equilibrium)  Sensible interpretation of mixed strategies (de facto purification)  Theory:  τ  ∞ converges to Nash equilibrium in (weakly) dominance solvable games  Equal splits in Nash demand games

28 Teck-Hua Ho CH Model April 4, 2004 Example 2: Entry games  Market entry with many entrants: Industry demand D (as % of # of players) is announced Prefer to enter if expected %(entrants) < D; Stay out if expected %(entrants) > D All choose simultaneously  Experimental regularity in the 1st period:  Consistent with Nash prediction, %(entrants) increases with D  “To a psychologist, it looks like magic”-- D. Kahneman ‘88

29 Teck-Hua Ho CH Model April 4, 2004 Example 2: Entry games (data)

30 Teck-Hua Ho CH Model April 4, 2004 Behaviors of Level 0 and 1 Players (  =1.25) Level 0 Level 1 % of Entry Demand (as % of # of players)

31 Teck-Hua Ho CH Model April 4, 2004 Behaviors of Level 0 and 1 Players(  =1.25) Level 0 + Level 1 % of Entry Demand (as % of # of players)

32 Teck-Hua Ho CH Model April 4, 2004 Behaviors of Level 2 Players (  =1.25) Level 2 Level 0 + Level 1 % of Entry Demand (as % of # of players)

33 Teck-Hua Ho CH Model April 4, 2004 Behaviors of Level 0, 1, and 2 Players(  =1.25) Level 2 Level 0 + Level 1 Level 0 + Level 1 + Level 2 % of Entry Demand (as % of # of players)

34 Teck-Hua Ho CH Model April 4, 2004 Entry Games (Imposing Monotonicity on CH Model)

35 Teck-Hua Ho CH Model April 4, 2004 Empirical Frequency: “zero-sum game”

36 Teck-Hua Ho CH Model April 4, 2004 MLE Estimation

37 Teck-Hua Ho CH Model April 4, 2004 Estimates of Mean Thinking Step 

38 Teck-Hua Ho CH Model April 4, 2004 CH Model: CI of Parameter Estimates

39 Teck-Hua Ho CH Model April 4, 2004 Nash versus CH Model: LL and MSD

40 Teck-Hua Ho CH Model April 4, 2004 CH Model: Theory vs. Data (Mixed Games)

41 Teck-Hua Ho CH Model April 4, 2004 Nash: Theory vs. Data (Mixed Games)

42 Teck-Hua Ho CH Model April 4, 2004 Nash vs CH (Mixed Games)

43 Teck-Hua Ho CH Model April 4, 2004 CH Model: Theory vs. Data (Entry and Mixed Games)

44 Teck-Hua Ho CH Model April 4, 2004 Nash: Theory vs. Data (Entry and Mixed Games)

45 Teck-Hua Ho CH Model April 4, 2004 CH vs. Nash (Entry and Mixed Games)

46 Teck-Hua Ho CH Model April 4, 2004 Economic Value  Evaluate models based on their value-added rather than statistical fit (Camerer and Ho, 2000)  Treat models like consultants  If players were to hire Mr. Nash and Ms. CH as consultants and listen to their advice (i.e., use the model to forecast what others will do and best-respond), would they have made a higher payoff?  A measure of disequilibrium

47 Teck-Hua Ho CH Model April 4, 2004 Nash versus CH Model: Economic Value

48 Teck-Hua Ho CH Model April 4, 2004 Example 3: P-Beauty Contest  n players  Every player simultaneously chooses a number from 0 to 100  Compute the group average  Define Target Number to be 0.7 times the group average  The winner is the player whose number is the closet to the Target Number  The prize to the winner is US$10

49 Teck-Hua Ho CH Model April 4, 2004 CH Model: Parameter Estimates

50 Teck-Hua Ho CH Model April 4, 2004 Summary  CH Model:  Discrete thinking steps  Frequency Poisson distributed  One-shot games  Fits better than Nash and adds more economic value  Explains “magic” of entry games  Sensible interpretation of mixed strategies  Can “solve” multiplicity problem  Initial conditions for learning