Skip to content

Beauty Contest Game

Have players simultaneously pick a number to land closest to p times the group average, so that iterated best-response contracts the target toward zero — turning the infinite tower of 'what others expect others to expect' into a single measurable reasoning-depth scalar read off the choices.

Core Idea

The beauty contest game — Keynes's 1936 metaphor, operationalized by Nagel (1995) — is a coordination game where each player picks a number and the payoff rewards proximity to p times the average, with p < 1. Iterating best-response from any belief contracts the target, reaching the unique Nash equilibrium at zero by iterated dominance. The game is a clean probe of iterated higher-order belief: how many rounds of "I think that you think that I think" a real population executes, with reasoning depth k as an observable scalar.

Scope of Application

The beauty contest game lives within a single home discipline — behavioural game theory — restaged across its strategic-interaction settings, bounded to populations running iterated best response on a complementarity payoff.

  • Experimental economics — the home: the workhorse for measuring level-k reasoning.
  • Macroeconomic expectations — the analytic core of Morris-Shin coordination-under-public-information models.
  • Behavioural finance — the "Keynesian beauty contest" theory of speculative pricing (metaphorical).
  • Bounded-rationality modelling — the level-k apparatus exported to auctions and signalling games.

Clarity

The game's clarifying force is to turn "how many rounds of strategic recursion do people run?" into a single observable number, since each reasoning level k maps to a distinct choice (≈50·pᵏ): a cluster at 33 is level-1, at 22 level-2, and the near-absence at 0 says almost no one iterates to the limit. It also makes legible the distinction between individual rationality and common knowledge of rationality at every order, so finite-depth play measures how far up that tower a population climbs rather than evidencing irrationality.

Manages Complexity

The complexity tamed is the unbounded recursion of higher-order belief — an infinite tower that drives speculative markets yet is intractable as stated. The game collapses it onto a single scalar, the level of reasoning k, by exploiting its payoff: each round multiplies the target by p, so depth k maps to one predicted choice. Because each depth is a distinct, separated prediction, the analyst reads the population's whole sophistication distribution off the choices, one number per player, and reads its responsiveness to stakes and experience off the same ladder.

Abstract Reasoning

The game licenses a diagnostic move reading reasoning depth off the choices via the depth-k mapping, a strategic best-response move setting one's own level one step above the counterparty's (explicitly not playing Nash at 0), a boundary-drawing move localizing the equilibrium's failure to the common-knowledge-of-rationality assumption, a comparative-statics move predicting how depth shifts with stakes and experience, and a reframing move reading speculative prices as expectations about expectations terminating at finite depth.

Knowledge Transfer

Within behavioural game theory the game transfers as mechanism, carried by the level-k framework — the diagnostic, the best-respond-one-deeper prescription, the common-knowledge boundary, and the comparative statics all carry wherever strategic complementarities make higher-order beliefs determine play (auctions, signalling, market-entry, macro coordination). These are one substrate restaged, not cross-substrate transfer. Beyond strategic interaction the game is a measurement probe valid only where reasoning agents exist, and the general ideas it makes vivid are carried by the parents common_knowledge, bounded_rationality, coordination_problem_and_equilibrium_selection, and expectations. Even Keynes's asset-pricing extension travels as metaphor.

Relationships to Other Abstractions

Local relationship map for Beauty Contest GameParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Beauty Contest GameDOMAINPrime abstraction: Keynesian Beauty Contest — is a decomposition ofKeynesianBeauty ContestPRIMEDomain-specific abstraction: Guess 2/3 of the Average — is a kind ofGuess 2/3 ofthe AverageDOMAIN

Current abstraction Beauty Contest Game Domain-specific

Parents (1) — more general patterns this builds on

  • Beauty Contest Game is a decomposition of Keynesian Beauty Contest Prime

    Removing the bounded-number experiment leaves the Keynesian structure in which the best choice depends on beliefs about others' beliefs and choices.

Children (1) — more specific cases that build on this

  • Guess ⅔ of the Average Domain-specific is a kind of Beauty Contest Game

    Guess ⅔ of the Average is the Beauty Contest Game with p fixed to two thirds, the action interval fixed to 0–100, and its canonical level ladder exposed.

Neighborhood in Abstraction Space

Beauty Contest Game sits in a crowded region of the domain-specific corpus (5th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Strategic Interaction & Game Theory (23 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12