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

Adverse Selection and Screening Mechanisms

Research Depth 105 in the knowledge graph ☐ I know this ☆ Set as goal
50topics build on this
565prerequisites beneath it
See this on the map →
Bayesian Games (Games of Incomplete Information)Game Theory Basics+4 more→→Insurance Markets with Adverse SelectionLabor Market Signaling: Education as a Signal+1 more
contract-theory information-asymmetry

Core Idea

Adverse selection occurs when private information (type) is correlated with transaction value. Screening mechanisms—menus of contracts with different terms—allow the uninformed party to infer types and separate market participants. Self-selection constraints ensure each type prefers its intended contract. Screening reduces but does not eliminate efficiency loss from adverse selection.

Explainer

From your study of Bayesian games and incomplete information, you know that players may hold private information that affects strategic outcomes. Adverse selection is what happens when this private information distorts market participation itself. The classic example is insurance: healthy people know they are low-risk and find high premiums unattractive, while sick people know they are high-risk and find the same premiums a bargain. If the insurer cannot distinguish types, the pool of buyers skews toward high-risk individuals — the selection of participants is adverse to the uninformed party. George Akerlof's "market for lemons" showed that in the extreme case, this unraveling can destroy the entire market.

Screening is the uninformed party's strategic response. Instead of offering a single contract and hoping for the best, the uninformed party offers a menu of contracts designed so that each type voluntarily selects the contract intended for them. Consider an insurance company offering two policies: a comprehensive plan with high premiums and low deductibles, and a basic plan with low premiums and high deductibles. High-risk individuals prefer the comprehensive plan because they expect to file many claims; low-risk individuals prefer the basic plan because they rarely need coverage. By designing the menu carefully, the insurer gets each type to self-select and reveal their private information through their choice.

The key technical constraints are incentive compatibility (each type must prefer the contract designed for it over any other contract in the menu) and individual rationality (each type must prefer participating to walking away). These constraints formalize what "designed carefully" means. Using the tools of constrained optimization you have studied, the screening problem becomes: maximize the uninformed party's payoff subject to incentive compatibility and participation constraints for every type. The solution typically involves distorting the contract offered to the low type — giving them less coverage or lower quality — to make their contract unattractive to the high type. The high type gets an efficient contract but pays a premium that extracts their information rent.

This distortion is the fundamental cost of adverse selection: efficiency is sacrificed to achieve separation. In a world of perfect information, both types would get efficient contracts. With screening, the high type does fine, but the low type receives a suboptimal deal. The gap between the first-best (full information) and second-best (screening) outcome represents the information rent — the price society pays for asymmetric information. This framework extends far beyond insurance: employers screening workers with probationary contracts, banks screening borrowers with collateral requirements, and airlines screening passengers with fare classes all follow exactly the same logic.

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 → Extensive Form Games and Game Trees → Subgame Perfect Equilibrium → Perfect Bayesian Equilibrium → Pooling and Separating Equilibria → Adverse Selection and Screening Mechanisms

Longest path: 106 steps · 565 total prerequisite topics

Prerequisites (6)

Leads To (3)