Parameterizing agent-based models using an online game
Bibliographic record
Abstract
Agent-based models (ABMs) of human systems are often parameterized using real-world data. For some ABMs this is not possible because the reality upon which the models are based does not exist or is not generalizable from one setting to another. In this paper we implement an online decision game to parameterize an agent-based model of pedestrian and cyclist route choice decisions in a neighbourhood. Our conceptual framework is to use an experimental game to log decision-making behaviour, summarize this behaviour into a decision model, and then transfer this model to an ABM. The product of this framework is an ABM with agents informed by human decision making made within the game, rather than the real world. The results of our analysis suggest that the decision model is consistent with some general theory about decision making, but the ABM illustrates some unique and contextually specific patterns of flow. ABMs parameterized with game data may be useful for forecasting the effects of change on urban transportation infrastructure. • Integration of a research game with a simulation of cyclists and pedestrian agents • Participants reveal their traffic control preferences through playing a game. • Participant responses are used to parameterize an agent-based simulation. • Simulation results reveal patterns of flow following a change in traffic control.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".