MétaCan
Menu
Back to cohort
Record W2946142237 · doi:10.1287/mnsc.2018.3162

Relational Contracts, Multiple Agents, and Correlated Outputs

2019· article· en· W2946142237 on OpenAlexfundno aff
Ola Kvaløy, Trond E. Olsen

Bibliographic record

VenueManagement Science · 2019
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsnot available
FundersUniversität KonstanzRyerson University
KeywordsAggregate (composite)Variance (accounting)TournamentIncentiveSet (abstract data type)Measure (data warehouse)Scheme (mathematics)Principal–agent problemComputer scienceEconometricsCorrelationEconomicsMathematicsMicroeconomicsMathematical optimizationData mining

Abstract

fetched live from OpenAlex

We analyze relational contracts between a principal and a set of risk-neutral agents whose outputs are correlated. When only the agents’ aggregate output can be observed, a team incentive scheme is shown to be optimal, where each agent is paid a bonus for aggregate output above a threshold. We show that the efficiency of the team incentive scheme depends on the way in which the team members’ outputs are correlated. The reason is that correlation affects the variance of total output and thus, the precision of the team’s performance measure. Negatively correlated contributions reduce the variance of total output, and this improves incentives for each team member in the setting that we consider. This also has implications for optimal team size. If the team members’ outputs are negatively correlated, more agents in the team can improve efficiency. We then consider the case where individual outputs are observable. A tournament scheme with a threshold is then optimal, where the threshold depends on an agent’s relative performance. We show that correlation affects both the efficiency and design of the optimal tournament scheme. This paper was accepted by Shivaram Rajgopal, accounting.

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.009
metaresearch head score (Gemma)0.024
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
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.009
Threshold uncertainty score0.046

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0090.024
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0010.004
Scholarly communication0.0040.005
Open science0.0020.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.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.084
GPT teacher head0.339
Teacher spread0.255 · 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 designTheoretical or conceptual
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
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueManagement ScienceSame topicAuction Theory and ApplicationsFrench-language works237,207