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 moreComputational 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSoundness Theorem and Validity of Proof SystemsDeductive Reasoning and Formal Proof SystemsFirst-Order ResolutionPropositional ResolutionSemantic Tableaux (Propositional)Semantic Tableaux (First-Order)Decidable Fragments of First-Order LogicGödel's Completeness Theorem for First-Order LogicGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicCompatibilismMoral ResponsibilityMoral PsychologyMoral Sentiments and EmotionsCare EthicsRational Choice and EthicsContractarian Moral FoundationsMoral Foundations and IntuitionsMoral RelativismIntroduction to Applied EthicsBioethics: FoundationsMedical Ethics & Patient AutonomyInformed Consent & Research EthicsResearch Ethics: Human Subjects ProtectionResearch Integrity and Open Science: Transparency and ReproducibilityMachine Learning Applications in Social ScienceAgent-Based Modeling in Social Science

Longest path: 114 steps · 1093 total prerequisite topics

Prerequisites (7)

Leads To (1)