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

Nash Refinements: Trembling Hand Perfection

Research Depth 103 in the knowledge graph ☐ I know this ☆ Set as goal
10topics build on this
526prerequisites beneath it
See this on the map →
Strategic Form Games and Nash EquilibriumMixed Strategy Equilibrium and Equilibrium in Randomized Strategies+1 more→→Signaling Games: Separating and Pooling Equilibria
game-theory equilibrium-selection

Core Idea

Trembling hand perfection refines Nash equilibrium by requiring robustness to small mistakes: an equilibrium is perfect if it is a limit of equilibria in perturbed games where players make small errors. This eliminates equilibria dependent on implausibly irrational off-path beliefs. An equilibrium is perfect if no player has an incentive to deviate even when others may occasionally make mistakes.

Explainer

From your study of strategic form games and Nash equilibrium, you know that a Nash equilibrium is a profile of strategies where no player can profitably deviate, given the others' strategies. The problem is that many games have multiple Nash equilibria, and some of them rely on threats or beliefs that seem unreasonable. Trembling hand perfection, introduced by Reinhard Selten, is a refinement that eliminates these implausible equilibria by asking: would this equilibrium survive if players occasionally made small mistakes?

Consider a simple coordination game. Suppose two firms must choose whether to enter a market. One Nash equilibrium has Firm A entering and Firm B staying out, sustained by Firm B's belief that Firm A will always enter. But what if there is a tiny chance — a "tremble" — that Firm A accidentally stays out? If Firm B's strategy is only optimal because it assumes Firm A never trembles, then the equilibrium is fragile. Trembling hand perfection requires that each player's strategy remains a best response even when every other player plays a completely mixed strategy — one that assigns small but positive probability to every available action. The equilibrium must be the limit of best responses as these tremble probabilities shrink to zero.

Formally, a Nash equilibrium is trembling hand perfect if there exists a sequence of completely mixed strategy profiles (where every action gets played with positive probability) converging to the equilibrium, such that each player's equilibrium strategy is a best response to every profile in the sequence. This rules out equilibria sustained by weakly dominated strategies. If a strategy is weakly dominated — meaning there exists another strategy that does at least as well against every opponent action and strictly better against some — then it cannot survive the tremble test. When opponents might tremble into any action with positive probability, the dominated strategy will underperform, and the player will abandon it.

The intuition is fundamentally about robustness: a credible equilibrium should not fall apart because of infinitesimal noise. In real strategic interactions — bargaining, auctions, market entry — players are not perfectly rational automatons. They make occasional errors, face computational limits, or experiment with off-equilibrium actions. Trembling hand perfection captures the idea that a good prediction about behavior should be robust to these small perturbations. If an equilibrium only works in a world of perfect rationality and zero mistakes, it is a poor prediction of actual play. This concept connects forward to Bayesian games, where incomplete information introduces a different kind of uncertainty about opponents' behavior, and the same spirit of robustness continues to drive equilibrium refinement.

Practice Questions 5 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 → Nash Equilibrium Refinements → Strategic Form Games and Nash Equilibrium → Mixed Strategies and Probabilistic Play → Mixed Strategy Equilibrium and Equilibrium in Randomized Strategies → Nash Refinements: Trembling Hand Perfection

Longest path: 104 steps · 526 total prerequisite topics

Prerequisites (3)

Leads To (1)