mean-field-crowds opportunity asserted
Mean-field crowds and traffic
Simulate hundreds of thousands of agents with equilibrium-consistent route and choice behavior by combining mean-field approximations with sampled individuals.
thesis
City builders face a ceiling where individually simulated agents cap population and aggregate models feel lifeless. Mean-field game theory describes how large populations of optimizing agents reach equilibrium, and GPU-parallel simulation makes iterating those fields cheap. A hybrid where the mean field sets congestion and choice probabilities and a sample of visible individuals follows them gives large populations that behave coherently.
design sketch
Traffic and pedestrian flows are fields updated each tick from a mean-field equilibrium solver on the GPU; visible cars and citizens are samples drawn from those fields, so congestion is consistent at scale while inspection still shows individuals with plausible trips.
validation experiment
Implement a mean-field traffic solver on a 100,000-trip city network and compare travel-time distributions with a full agent-based baseline. Success: within 10 percent on mean and 90th percentile travel times at a tenth of the compute.
key risks
- Players notice when sampled individuals behave inconsistently with fields.
- Equilibrium solvers can be slow to converge under rapid change.
- Engineering cost to retrofit existing engines.
falsifiable prediction
A city builder will document a mean-field or continuum crowd model as its primary traffic or population simulation.
Released or patched after 2026-10-24 in a title with at least 1,000 Steam user reviews; developer documentation names a mean-field, continuum, or equilibrium-field method used at runtime for the main traffic or population model.