MétaCan
Menu
Back to cohort
Record W2127574131 · doi:10.1287/mnsc.47.2.280.9839

Efficient Timing of Communication in Multiperiod Agencies

2001· article· en· W2127574131 on OpenAlexaff
Peter Christensen, Gerald A. Feltham

Bibliographic record

VenueManagement Science · 2001
Typearticle
Languageen
FieldDecision Sciences
TopicGame Theory and Applications
Canadian institutionsUniversity of British Columbia
FundersSamfund og Erhverv, Det Frie Forskningsråd
KeywordsOutcome (game theory)Value (mathematics)Private information retrievalImperfectComputer scienceEconomicsConsumption (sociology)MicroeconomicsSIGNAL (programming language)EconometricsMathematical economicsStatisticsMathematicsComputer security

Abstract

fetched live from OpenAlex

This paper examines communication in a two-period principal/agent model in which the agent receives a private signal about the second outcome before the first outcome is realized. No communication is compared with communication at three possible dates: before the first outcome (early), at the first outcome/consumption date (normal), and between the initial consumption date and the second outcome (delayed). Delayed communication is shown to have no value if the agent's information is perfect, but can have value if it is imperfect. Early and normal communication can be used to “smooth” compensation across periods and, hence, generally have incremental value over delayed communication if the agent cannot borrow or save. However, the “smoothing” benefits disappear if he can borrow and save. Early and normal communication are equivalent if the agent has domain-additive exponential preferences and the private signal is uninformative about the first outcome. If the private signal is informative about the first outcome, the incremental value of early compared with normal communication attains its maximum for “medium” informativeness. A unifying example is used throughout.

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.037
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.047

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0090.037
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0020.003
Scholarly communication0.0060.008
Open science0.0020.003
Research integrity0.0040.003
Insufficient payload (model declined to judge)0.0070.001

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.141
GPT teacher head0.402
Teacher spread0.261 · 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

Citations8
Published2001
Admission routes1
Has abstractyes

Explore more

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