Decision versus compromise for animal groups in motion
Bibliographic record
Abstract
Previously, we showed using a computational agent-based model that a group of animals moving together can make a collective decision on direction of motion, even if there is a conflict between the directional preferences of two small subgroups of "informed" individuals and the remaining "uninformed" individuals have no directional preference. The model requires no explicit signaling or identification of informed individuals; individuals merely adjust their steering in response to socially acquired information on relative motion of neighbors. In this paper, we show how the dynamics of this system can be modeled analytically, and we derive a testable result that adding uninformed individuals improves stability of collective decision making. We first present a continuous-time dynamic model and prove a necessary and sufficient condition for stable convergence to a collective decision in this model. The stability of the decision, which corresponds to most of the group moving in one of two alternative preferred directions, depends explicitly on the magnitude of the difference in preferred directions; for a difference above a threshold the decision is stable and below that same threshold the decision is unstable. Given qualitative agreement with the results of the previous simulation study, we proceed to explore analytically the subtle but important role of the uninformed individuals in the continuous-time model. Significantly, we show that the likelihood of a collective decision increases with increasing numbers of uninformed individuals.
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.011 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".