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

Synthetic Control Methods

Research Depth 117 in the knowledge graph ☐ I know this ☆ Set as goal
1,265prerequisites beneath it
See this on the map →
Natural Experiments and Quasi-Experimental DesignConjoint Analysis and Stated Preference Methods+24 more→
causal-inference comparative counterfactual policy-evaluation

Core Idea

Synthetic control constructs a counterfactual for a treated unit by taking a weighted combination of untreated units. When a single unit (country, region, organization) experiences an intervention, its pre-intervention trends may not match any single control unit, but a weighted average may. The method estimates the treatment effect as the post-intervention difference between the treated unit and its synthetic control. It is particularly useful for policy evaluation when aggregate data is available but individual randomization is infeasible.

Explainer

From natural experiments, you know that causal identification requires a credible counterfactual: what would have happened to the treated unit if it had not been treated? The challenge in many policy contexts is that the unit of treatment is a whole country, state, or city — you cannot randomize, and no single comparison unit may look much like it. Synthetic control addresses exactly this problem by constructing an artificial comparison unit from a weighted combination of untreated units.

The canonical example is Abadie, Diamond, and Hainmueller's study of the effect of California's 1988 tobacco control program on per-capita cigarette sales. No single state looks quite like California in the pre-1988 period — not in terms of economic conditions, demographics, and pre-existing cigarette consumption trends. But a synthetic California — a weighted average of Colorado (58.9%), Utah (8.6%), Nevada (23.3%), and a few others — tracks California's pre-intervention trajectory extremely well over the prior 17 years. After 1988, observed California diverges below synthetic California. That gap is the estimated treatment effect.

The weights are chosen to minimize the discrepancy between the treated unit and the synthetic control on pre-intervention outcomes and predictors. This is a transparent, data-driven process: you see exactly which donor units contribute to the synthetic control and in what proportions. The pre-intervention fit is directly verifiable — you plot both series and inspect how closely they track. This is a significant advantage over regression-based approaches where the counterfactual is implicit. If the pre-intervention fit is poor, the synthetic control is not credible, and you know it.

Inference in synthetic control is done through placebo tests rather than classical standard errors. The idea: apply the same method to each untreated unit in the donor pool, pretending it received the treatment. Each untreated unit generates its own synthetic control and its own estimated "effect." The distribution of these placebo estimates tells you how unusual your actual estimated effect is. If California's post-intervention gap is much larger than any of the placebo gaps, that is evidence the effect is real. If many placebos show similar gaps, the California result is unexceptional. This permutation-based inference is appropriate because you have one treated unit — asymptotic theory is irrelevant.

The method has important limitations. It requires a reasonably long pre-intervention period to construct and validate the synthetic control. It requires a donor pool of untreated units that are genuinely comparable — if the treated unit is an outlier (e.g., the United States as a whole), there may be no good synthetic. It also assumes that the untreated donor units are not themselves affected by the intervention (the stable unit treatment value assumption). Despite these constraints, synthetic control has become a standard tool in comparative policy analysis precisely because it makes the counterfactual construction transparent and the credibility of the identification directly inspectable.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → One-to-One Correspondence → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Making 10 as an Addition Strategy → 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 → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → Combining Like Terms → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → Compatibilism → Moral Responsibility → Moral Psychology → Moral Sentiments and Emotions → Care Ethics → Rational Choice and Ethics → Contractarian Moral Foundations → Moral Foundations and Intuitions → Moral Relativism → Introduction to Applied Ethics → Bioethics: Foundations → Medical Ethics & Patient Autonomy → Informed Consent & Research Ethics → Research Ethics: Human Subjects Protection → Ethnographic Fieldwork: Positionality and Research Ethics → Ethnographic Interviewing and Qualitative Data Collection → Advanced Ethnographic Methods → Digital and Virtual Ethnography → Collaborative and Reflexive Ethnography → Participatory Action Research Methods → Synthetic Control Methods

Longest path: 118 steps · 1265 total prerequisite topics

Prerequisites (26)

Leads To (0)

No topics depend on this one yet.