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

Agent-Based Modeling in Social Science

Research Depth 113 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
1,093prerequisites beneath it
See this on the map →
Algorithm Analysis and Big-O NotationComputational Social Science+5 more→→Computational Simulation of Social Systems
computational simulation agents modeling

Core Idea

Agent-based models (ABMs) simulate social systems as collections of autonomous agents interacting according to explicit rules. Each agent makes decisions based on local information and behavioral rules, producing emergent patterns at the system level. ABMs are uniquely suited to studying how individual-level decisions aggregate into collective outcomes—e.g., segregation, cooperation, opinion polarization—and exploring counterfactual scenarios impossible to observe empirically.

Explainer

From your study of computational social science, you know that social phenomena often resist simple analytic equations — human behavior is heterogeneous, context-dependent, and shaped by feedback loops. Agent-based modeling is the methodological response: instead of writing a formula that describes the whole population, you program individual agents, give each a set of behavioral rules, and let the system run. The emergent outcome — what happens at the macro level — is the result you study. Crucially, no one programmed that macro outcome directly; it arose from many micro-level interactions.

Thomas Schelling's segregation model is the canonical demonstration. Each agent (a household) prefers at least 30% of its neighbors to share its group. That preference seems mild — most agents would accept a mixed neighborhood. Yet when the model runs, the result is near-total segregation. The macro pattern is far more extreme than anyone's individual preference demanded. This is emergence: the system-level outcome cannot be read off the individual rules. ABMs let you study this gap between micro intent and macro outcome — a gap that analytic mathematics struggles to capture when agents are heterogeneous and interactions are local.

Building an ABM requires the skills you have from algorithm analysis and probability. You must define the agent state (what attributes each agent holds — wealth, location, opinion, health status), the behavioral rules (decision functions, often stochastic — your probability background matters here), the environment (typically a spatial grid or network), and the update schedule (sequential or simultaneous). Differential equations appear when you want to validate the ABM against known aggregate dynamics: if your agent rules are internally consistent, the aggregate behavior of your ABM should recover the approximate trajectory predicted by a corresponding differential equation model under idealized conditions. This connection grounds ABMs in formal theory rather than leaving them as ad hoc simulations.

The key methodological challenge is validation. Because ABMs generate synthetic data rather than observing the world, it is easy to tune parameters until the model produces plausible-looking output — this is not validation. Rigorous ABM work requires: theoretical justification for agent rules (not post-hoc fitting), sensitivity analysis across parameter ranges to check which results are robust versus fragile, and comparison to multiple empirical patterns the model was not fitted on. The model's power is not that it matches one historical case — it is that it lets you run counterfactuals (what if the preference threshold were 50%? what if agents had imperfect information?) that are impossible to observe in real social data. This connects back to your research design training: ABMs extend quasi-experimental logic into theoretically constructed worlds where you control all parameters.

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 → 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 → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → 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 → Research Integrity and Open Science: Transparency and Reproducibility → Machine Learning Applications in Social Science → Agent-Based Modeling in Social Science

Longest path: 114 steps · 1093 total prerequisite topics

Prerequisites (7)

Leads To (1)