MétaCan
Menu
Back to cohort

Overcompensation as a Partial Solution to Commitment and Renegotiation Problems: The Case of <i>Ex Post</i> Moral Hazard

2004· article· en· W3123912743 on OpenAlexaff
M. Martin Boyer

Bibliographic record

VenueJournal of Risk & Insurance · 2004
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsUniversité de MontréalHEC Montréal
Fundersnot available
KeywordsCommitMoral hazardPrincipal (computer security)Economic rentAuditIndemnityIncentiveEconomicsActuarial sciencePaymentState (computer science)Private information retrievalAccident (philosophy)MicroeconomicsBusinessFinanceAccountingComputer scienceComputer security

Abstract

fetched live from OpenAlex

Abstract In a Costly State Verification world, an agent who has private information regarding the state of the world must report what state occurred to a principal, who can verify the state at a cost. An agent then has what is called ex post moral hazard: he has an incentive to misreport the true state to extract rents from the principal. Assuming the principal cannot commit to an auditing strategy, the optimal contract is such that: (1) the agent's expected marginal utility when there is an accident (high‐ and low‐loss states) is equal to his marginal utility when there is no accident; (2) the lower loss is undercompensated, while the higher loss is overcompensated; and (3) the welfare of the agent is greater under commitment than under no‐commitment. Result 2 is contrary to the results obtained if the principal can commit to an auditing strategy (higher losses underpaid and lower losses overpaid). The reason is that by increasing the difference between the high and the low indemnity payments, the probability of fraud is reduced.

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.013
metaresearch head score (Gemma)0.038
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.013
Threshold uncertainty score0.067

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0130.038
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0010.001
Science and technology studies0.0020.004
Scholarly communication0.0040.005
Open science0.0030.005
Research integrity0.0060.005
Insufficient payload (model declined to judge)0.0110.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.046
GPT teacher head0.337
Teacher spread0.291 · 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

Citations38
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Risk & InsuranceSame topicAuction Theory and ApplicationsFrench-language works237,207