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

Incentive Compatibility and Individual Rationality

Research Depth 102 in the knowledge graph ☐ I know this ☆ Set as goal
61topics build on this
556prerequisites beneath it
See this on the map →
Bayesian Games (Games of Incomplete Information)Individual Rationality (Participation Constraint)+1 more→→Incentive CompatibilityMoral Hazard+1 more
contract-theory mechanism-design

Core Idea

Incentive compatibility requires that each agent's optimal action is truth-telling (or the action chosen). Individual rationality requires agents accept the contract (participate). In contract design, these constraints limit efficiency: the planner must offer rents to induce truthful reporting or effort, creating information rents that reduce total surplus. The tradeoff between incentives and efficiency is fundamental to contract theory.

Explainer

Imagine you are an insurance company designing a health plan, and your customers know more about their own health risks than you do. You would like each customer to choose the plan suited to their actual risk level — healthy people pick the low-coverage plan, sick people pick the high-coverage plan. But sick people might prefer the cheaper low-coverage plan if it saves them money upfront, and healthy people might claim to be sick to get extra coverage at a subsidized rate. The challenge is designing a menu of contracts where every type of customer voluntarily selects the option intended for them. This is the problem that incentive compatibility constraints address.

Formally, an incentive compatibility (IC) constraint says that each agent must weakly prefer the outcome designed for their true type over the outcome designed for any other type. If you are a high-risk customer, the contract meant for high-risk people must give you at least as much utility as pretending to be low-risk would. An individual rationality (IR) constraint (also called a participation constraint) says that each agent must prefer participating in the mechanism to their outside option — walking away entirely. Together, IC and IR define the feasible set of contracts: any contract design that violates IC will be gamed by some agents lying about their type, and any design that violates IR will be rejected outright.

The deep insight from your study of Bayesian games and incomplete information is that these constraints have real costs. In a world of complete information, the designer could simply assign the efficient outcome to each type. But with private information, the designer must make it in each agent's self-interest to reveal their type truthfully, and this typically requires leaving information rents — extra surplus that well-informed agents capture precisely because they could profitably misrepresent themselves. High-value buyers in an auction get rents because they could pretend to be low-value. Productive workers get rents because they could shirk. These rents are the price of truthful revelation.

The tradeoff between efficiency and information rents shapes virtually every real-world contract and institution. Tax authorities cannot observe taxpayers' true incomes, so they must design tax schedules where honest reporting is incentive-compatible — this is why optimal income taxes involve distortions away from the first-best. Employers cannot observe workers' effort directly, so they use performance pay that satisfies IC for effort provision. With quasi-linear preferences (which you may have studied), the analysis simplifies considerably because the IC constraints reduce to conditions on the allocation alone, independent of baseline wealth, making the mathematical characterization of optimal mechanisms much cleaner. But the fundamental lesson holds regardless of preference structure: whenever one party has private information, the other party must sacrifice some surplus to elicit truthful behavior, and the optimal mechanism balances this information cost against allocative efficiency.

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 → Bayesian Games (Games of Incomplete Information) → Mechanism Design: Strategic Implementation → Individual Rationality (Participation Constraint) → Incentive Compatibility and Individual Rationality

Longest path: 103 steps · 556 total prerequisite topics

Prerequisites (3)

Leads To (3)