MétaCan
Menu
Back to cohort
Record W2778383114 · doi:10.1002/oca.2390

The optimal control of Axelrod's social norm game

2017· article· en· W2778383114 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueOptimal Control Applications and Methods · 2017
Typearticle
Languageen
FieldSocial Sciences
TopicEvolutionary Game Theory and Cooperation
Canadian institutionsUniversity of Guelph
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsNorm (philosophy)Mathematical economicsNash equilibriumIncentiveReplicator equationGame theoryMathematicsComputer scienceEconomicsMicroeconomicsSociologyPopulationPolitical scienceLaw

Abstract

fetched live from OpenAlex

Summary In this paper, we study the well‐known Axelrod's social norm game using replicator dynamics and control theory. In general, a social norm game has 4 pure strategies: norm following and norm defecting, each of which branching further into punishing or not punishing others for defection, if observed. Our aim is to check whether by introducing a control parameter that mimics incentives for players who follow the norm, we observe changes in the dynamics of the strategy game, which maximize norm‐following strategies. We solve the control problem numerically and find that incentives and the capacity of individuals to observe others' defection both have an impact on the emergence of Nash equilibria in which norm following is dominant.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.968
Threshold uncertainty score0.997

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0040.001
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.019
GPT teacher head0.392
Teacher spread0.373 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it