Behavioral Game Theory

Graduate Depth 77 in the knowledge graph I know this Set as goal
level-k cognitive-hierarchy quantal-response-equilibrium Camerer strategic-cognition

Core Idea

Behavioral game theory studies how people actually make strategic decisions, documenting systematic departures from Nash equilibrium and developing formal models that incorporate bounded rationality into strategic interaction. Three major frameworks have emerged: level-k thinking models, where players differ in how many steps of strategic reasoning they perform (level-0 randomizes, level-1 best-responds to level-0, level-2 best-responds to level-1, etc.); cognitive hierarchy models (Camerer, Ho, and Chong, 2004), which generalize level-k by allowing players to best-respond to a Poisson-distributed mixture of lower levels; and quantal response equilibrium (McKelvey and Palfrey, 1995), where players choose better strategies more often but make errors proportional to a noise parameter, converging to Nash as noise vanishes. These models explain canonical anomalies — overbidding in auctions, under-contribution in public goods games, and non-equilibrium play in beauty contest games — that standard game theory cannot.

Explainer

Standard game theory assumes that players are perfectly rational, have correct beliefs about others' rationality, and reason through infinite levels of "I think that you think that I think..." until reaching Nash equilibrium. Behavioral game theory starts from the empirical observation that this assumption fails systematically: in experiments, people rarely play Nash strategies in one-shot games, they overbid in auctions, they contribute to public goods when free-riding is dominant, and they reject unfair offers when acceptance is strategically optimal. The question is not whether Nash fails descriptively — that is clear — but what formal model better predicts actual strategic behavior.

The level-k framework provides one answer. Instead of assuming all players perform infinite strategic reasoning, it assigns each player a discrete "level" of thinking. A level-0 player does not reason strategically at all — they might randomize uniformly or follow a salient focal point. A level-1 player assumes everyone else is level-0 and best-responds accordingly. A level-2 player assumes everyone else is level-1 and best-responds to that. The beauty contest game illustrates this cleanly: with a target of 2/3 of the average and a range of 0-100, level-0 averages 50, level-1 chooses 33, level-2 chooses 22, level-3 chooses 15, and the Nash equilibrium of 0 requires infinite levels. Experimental data cluster around 33 and 22, suggesting most people are level-1 or level-2 thinkers in novel strategic situations.

Cognitive hierarchy (CH) refines level-k in an important way. In level-k models, a level-2 player assumes everyone is level-1 — ignoring level-0 players entirely. In the cognitive hierarchy model, a level-2 player best-responds to a mixture of level-0 and level-1 players, weighted by their estimated frequencies in the population. The distribution of types follows a Poisson distribution with a single parameter tau representing the average number of thinking steps. This produces smoother and generally more accurate predictions. Camerer, Ho, and Chong (2004) estimated tau around 1.5 across dozens of experimental games — a stable parameter that gives the model genuine out-of-sample predictive power.

Quantal response equilibrium takes a different approach entirely. Rather than modeling discrete levels of reasoning, QRE assumes all players are noisy optimizers: they choose better strategies more often than worse ones, but with error. The key innovation is that the noise is endogenous to the equilibrium — each player's noisy strategy is a quantal best response to the other players' noisy strategies. When the precision parameter lambda is high, choices are nearly optimal and QRE approximates Nash. When lambda is low, choices are nearly random. QRE explains several puzzles simultaneously: the tendency to play dominated strategies at low rates (not zero, as Nash predicts), the sensitivity of behavior to payoff magnitudes (people play closer to Nash when stakes are higher, because the cost of errors is higher), and the persistent but declining deviations from equilibrium with experience.

These three frameworks are not mutually exclusive — they capture different aspects of bounded rationality in strategic settings. Level-k and cognitive hierarchy model limited depth of strategic reasoning (people do not think far enough ahead). QRE models imprecise execution of strategic reasoning (people think roughly correctly but implement noisily). Empirically, level-k/CH models fit initial play in novel games better, while QRE fits experienced play and games with continuous strategy spaces better. Together, they constitute the theoretical core of behavioral game theory and have been applied to auctions, mechanism design, political competition, and bargaining, producing both better predictions and better-designed institutions.

Practice Questions 3 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsCombining Like TermsOne-Step EquationsTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesLiteral EquationsSlope-Intercept FormPoint-Slope FormWriting Linear EquationsParallel and Perpendicular Line SlopesGraphing Linear EquationsPiecewise FunctionsOne-Sided LimitsContinuity DefinitionLimit Definition of the DerivativePower RuleConstant Multiple and Sum/Difference RulesProduct RuleChain RuleDerivatives of Exponential FunctionsDerivatives of Logarithmic FunctionsImplicit DifferentiationComparative StaticsPrice Elasticity of DemandIncome and Cross-Price ElasticityUtility and PreferencesMarginal Utility and Diminishing ReturnsProfit MaximizationPerfect CompetitionShutdown and Breakeven DecisionsMonopolyMonopolistic CompetitionOligopoly and Strategic BehaviorGame Theory BasicsNash EquilibriumBehavioral Game Theory

Longest path: 78 steps · 399 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.