MétaCan
Menu
Back to cohort
Record W2166193748 · doi:10.1287/deca.1120.0247

Sharing Rewards Among Strangers Based on Peer Evaluations

2012· article· en· W2166193748 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.

Bibliographic record

VenueDecision Analysis · 2012
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsCollusionIncentive compatibilityIntuitionComputer scienceMechanism (biology)IncentiveMicroeconomicsMechanism designGroup decision-makingEconomicsPsychologySocial psychology

Abstract

fetched live from OpenAlex

We study a problem where a new, unfamiliar group of agents has to decide how a joint reward should be shared among them. We focus on settings where the share that each agent receives depends on the evaluations of its peers concerning that agent's contribution to the group. We introduce a mechanism to elicit and aggregate evaluations as well as for determining agents' shares. The intuition behind the proposed mechanism is that each agent has its expected share maximized to the extent that it is well evaluated by its peers and that it is truthfully reporting its evaluations. For promoting truthfulness, the proposed mechanism uses a peer-prediction method built on strictly proper scoring rules. Under the assumption that agents are Bayesian decision makers, we show that our mechanism is incentive compatible and budget balanced. We also provide sufficient conditions under which the proposed mechanism is individually rational, resistant to some kinds of collusion, and fair.

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.009
metaresearch head score (Gemma)0.005
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: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.608
Threshold uncertainty score0.998

Codex and Gemma teacher scores by category

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

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.150
GPT teacher head0.474
Teacher spread0.324 · 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