Skip to content
Preprint

Three Ceilings: Model Monoculture, Solvency, and the Penalty Doctrine in Markets for Expert Services

Aug 2026 · 3 citations · 43 references
Economics

Abstract

When generative AI drives the marginal cost of a persuasive expert artefact toward zero, production-cost signals of competence collapse and outcome-contingent liability commitments take their place. Such commitments look robust to better AI: a positive failure rate always leaves a residual to price. We show that this robustness rests on an unstated homogeneity assumption, and that a liability commitment faces three ceilings, not one. AI error decomposes into idiosyncratic and common components; capability growth eliminates the idiosyncratic part faster (Kim et al., 2025), so the residual becomes progressively common - and common error is precisely what a verifier drawn from the same foundation model cannot observe: judge scores correlate with judge-generator model similarity at an average r=0.84 (Goel et al., 2025). Provability is therefore state-dependent, theta_eff = theta_0(1 - xi*kappa). Separation requires the commitment that must be posted to fall below what can be posted, v/theta_eff<= min{Lbar, mv}, yielding the survival condition xi*kappabar<= 1 - 1/(M*theta_0) with M = min{Lbar/v, m} and a regime switch at the ticket size v* = Lbar/m: small engagements are constrained by the penalty doctrine, large ones by capital. Calibrated to six engagement types across four jurisdictions, the generative-AI insurance exclusions effective January 2026 shift eight of twenty-four cells from doctrine-bound to solvency-bound and cut the cells surviving xi=0.4 from twelve to four. The insurance withdrawal is a civil-law event; the common-law cells were already at the boundary.

View source

Similar papers

#natural language process... Preprint Oct 2026

Two Uncertainties Are Not One: Disagreement versus Decision-Risk in Cheap Structured Content Moderation

Content moderation compresses a graded, contested human judgment into a binary act (leave up / take down) over billions of items, at a scale where running a frontier LLM on every post is uneconomical. A new class of frozen"System One"models returns typed, calibrated decisions instead of text at ~USD 0.000025 per call a...

Karan Yadav · 0 citations
Open access Nov 2026

Deciding in the shadow of the state: when regulatory logic collides with market logic

Capital allocation models treat planning inputs as market-governed, even when they originate from political authority. Written for The Practice of Making Decisions section of Management Decision, this paper develops a three-phase response: classify each input, stress test it against a change of authority and design...

Amadeus Gabriel · 0 citations

Persuaded, Not Informed: Incentive-Misaligned Witnesses Defeat In-Context Grounding

This work identifies a failure mode not addressed by a stronger model: when the context contains an assertion by a party with an incentive toward optimism - here the sales representative, a witness recorded in the CRM - the model treats the assertion as evidence and clears deals the company's own records deem unaccepta...

Rahul Balakavi · 1 citation
Open access Oct 2026

Strategic overconfidence as an organisational capability and liability

Strategic management has reached opposite conclusions about executive overconfidence. One body of work links it to inflated acquisition premiums, escalating commitment and misreporting; another to innovation, market entry and venture persistence. The field has reconciled these findings by adding moderators, which prese...

Tobias Nakamura, Ingrid Solberg, Owen Kirkwood · 0 citations
Preprint Oct 2026

What a Shorter Contest Really Costs: Serial Dependence, Effective Trials, and Evidence from a Rule Change in Professional Esports

Operational research evaluates tournament formats by their efficacy, the probability that the design identifies the stronger competitor, and computes it almost exclusively by simulation under an assumption that is rarely tested: that the trials a format aggregates are independent. We show that this assumption systemati...

Petr Parshakov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.