Bibliographic record
Abstract
Abstract Evolutionary game theory is used to predict the behavior of individuals in populations (either of humans or other species) without relying on a detailed description of how these behaviors evolve over time (e.g., the replicator equation or the best response dynamics). For instance, if these behaviors correspond to a population state that satisfies the static payoff‐comparison conditions of an evolutionarily stable strategy (ESS), then there is typically dynamic (i.e., evolutionary) stability at this state. We begin with a thorough summary of the evolutionary game theory perspective, when there is a finite set of (pure) strategies, for a symmetric two‐player game in either normal or extensive form. The article then briefly discusses generalizations of evolutionary game theory, ESS, and evolutionary stability to several other classes of games. These include symmetric population games where payoffs to pure strategies are nonlinear functions of the current population state as well as asymmetric games where players are assigned different roles (e.g., two‐role bimatrix games). Although terminology borrowed from evolutionary game theory applied to behaviors of individuals in biological species is used throughout, the concepts introduced are equally relevant in games modeling human behavior.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 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".