MétaCan
Menu
Back to cohort
Record W3137879217 · doi:10.1109/tcns.2021.3065655

Rationality, Imitation, and Rational Imitation in Spatial Public Goods Games

2021· article· en· W3137879217 on OpenAlexaff
Alain Govaert, Pouria Ramazi, Ming Cao

Bibliographic record

VenueIEEE Transactions on Control of Network Systems · 2021
Typearticle
Languageen
FieldSocial Sciences
TopicEvolutionary Game Theory and Cooperation
Canadian institutionsUniversity of Alberta
FundersEuropean Research CouncilNederlandse Organisatie voor Wetenschappelijk Onderzoek
KeywordsImitationMathematical economicsComputer scienceNash equilibriumTragedy of the commonsArtificial intelligenceMathematicsPsychologyCommons

Abstract

fetched live from OpenAlex

In both economic and evolutionary theories of games, two general classes of evolution can be identified: 1) dynamics based on myopic optimization and 2) dynamics based on imitations or replications. The collective behavior of structured populations governed by these dynamics can vary significantly. Particularly in social dilemmas, myopic optimizations typically lead to Nash equilibrium payoffs that are well below the optimum, e.g.,the tragedy of the commons, whereas imitations can hinder equilibration while allowing higher cooperation levels and payoffs. Motivated by economic and behavioral studies, in this article, we investigate how the benefits of the two dynamics can be combined in an intuitive decision rule,rational imitation, that is to mimic successful others only if it earns you a higher payoff. In contrast to purely rational (best-response) or purely imitative decision rules, the combination inrational imitationdynamics both guaranteesfinite time convergenceto an imitation equilibrium profile on arbitrary networksandcan facilitatehigh levels of cooperationfor small public goods multipliers.

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 imitation

Not 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.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.015
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.005
Scholarly communication0.0030.004
Open science0.0010.002
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0020.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.025
GPT teacher head0.273
Teacher spread0.248 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations17
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Control of Network SystemsSame topicEvolutionary Game Theory and CooperationFrench-language works237,207