MétaCan
Menu
Back to cohort
Record W4396696261 · doi:10.3982/te5183

Relational enforcement

2024· article· en· W4396696261 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueTheoretical Economics · 2024
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicLaw, Economics, and Judicial Systems
Canadian institutionsnot available
FundersCity of VancouverHausdorff Center for MathematicsAcademy of FinlandDeutsche ForschungsgemeinschaftUniversity of California Berkeley
KeywordsComputer scienceEnforcementBusinessPolitical scienceLaw

Abstract

fetched live from OpenAlex

A principal incentivizes an agent to maintain compliance and to truthfully announce any breaches of compliance. Compliance is imperfectly controlled by the agent's private effort choices, is partially persistent, and is verifiable by the principal only through costly inspections. We show that in principal‐optimal equilibria, the principal enforces maximum compliance using deterministic inspections. Periodic inspection cycles are suspended during periods of self‐reported noncompliance, during which the agent is fined. We show how commitment to random inspections would benefit the principal, and discuss possible ways for the principal to overcome her commitment problem.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.916
Threshold uncertainty score0.992

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0090.011

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.027
GPT teacher head0.213
Teacher spread0.185 · 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