The Endogeneity of Miscalibration: Impossibility and Escape in Scored Reporting
cs.GT, cs.AI, cs.MA, econ.TH, math.OC
Submitted: 2026-05-08
Updated: 2026-10-05
Comments: 39 pages, no figures, all proofs inline
License: http://creativecommons.org/licenses/by/4.0/
The gist: An agent's probability report is paid for twice: by a strictly proper scoring rule, and by an approval rule for the decision it triggers.
Terminology
Abstract
An agent's probability report is paid for twice: by a strictly proper scoring rule, and by an approval rule for the decision it triggers. In this classical decision-coupled setting, non-affine approval is known to defeat truthful reporting. We show the conflict is endogenous: when feasible, the welfare-maximizing approval rule is never affine. The distortion, however, is predictable and can be designed around. There is a reserve report at which pretending to be the marginal type costs exactly the approval prize. Approving at or above the reserve screens types perfectly under every strictly proper score, and the reserve does not depend on the type distribution. A Lipschitz rule with a single kink attains first-best exactly; under strict feasibility no continuously differentiable rule does. The binding constraint is steepness, not smoothness. First-best is attainable within a slope budget if and only if the budget is at least the critical slope: the steepest chord of the pretending cost up to the reserve. Below it the welfare loss is cubic in the shortfall. Where the pretending cost is convex up to the reserve, as for Brier, log and power scores, the critical slope is closed-form. The instances are AI-agent oversight and marketplace operation.
Sources
- Data-Driven Mechanism Design: Jointly Eliciting Preferences and Information
- Information Design and Mechanism Design: An Integrated Framework
- AI safety via debate
- Categorizing Variants of Goodhart's Law
Related papers
- Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
- In-Context Credit Assignment via the Core
- Optimal Regret for Online Market Making with Limit Order Book
- Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
- Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
- LLM Bidders Preserve the Mechanism-Level Orderings of Human Bidders