A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Behavioral Game Theory

Graduate Depth 99 in the knowledge graph ☐ I know this ☆ Set as goal
524prerequisites beneath it
See this on the map →
Bounded RationalityGame Theory Basics+2 more→
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

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Literal Equations → Slope-Intercept Form → Point-Slope Form → Writing Linear Equations → Parallel and Perpendicular Line Slopes → Graphing Linear Equations → Piecewise Functions → One-Sided Limits → Continuity Definition → Limits and Continuity in Multiple Variables → Functions of Several Variables → Continuity in Multiple Variables → Partial Derivatives: Definition and Computation → Differentiability in Multiple Variables → Differentiability in Multivariable Functions → Total Differential and Linear Approximation → Chain Rule for Multivariable Functions → Implicit Differentiation → Related Rates → Optimization Problems → Critical Points of Multivariable Functions → Critical Points and Classification of Extrema → Second Partial Test for Local Extrema (Hessian) → The Hessian Matrix and Second Derivative Test → Unconstrained Optimization: Finding Extrema → Optimization in Multiple Variables → Lagrange Multipliers → Constrained Optimization and Lagrange Multipliers → Utility and Preferences → Marginal Utility and Diminishing Returns → Profit Maximization → Perfect Competition → Shutdown and Breakeven Decisions → Monopoly → Monopolistic Competition → Oligopoly and Strategic Behavior → Game Theory Basics → Nash Equilibrium → Behavioral Game Theory

Longest path: 100 steps · 524 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.