JEL classification: D82, L14, L15, C73

Email addresses: [email protected] (E. Iyidogan), [email protected] (Ali I. Ozkes)

Introduction

Many industries increasingly rely on AI agents ([3]; [5]). These software entities intermediate between upstream general-purpose model providers (e.g., large language models, LLMs) and end users by converting queries into structured prompts, routing them to one or several models, and post-processing the returned completions ([8]). Their economic role resembles that of traditional data vendors and consultancy firms, yet two technological facets distinguish them. First, the upstream supply side offers a discrete menu of models that differ markedly in both their per-query price and their output quality, measured for instance by the baseline hallucination rate, the rate at which the model falsely claims to have performed an action or generated a correct response ([4]; [6]). Second, downstream agents can apply various techniques to reduce hallucinations, such as retrieval-augmentation, ensembling, or human-in-the-loop verification ([9]). In other words, AI agents choose two quality levers: which model to call and how much effort to expend in verification.

Agents’ quality choices determine the equilibrium mapping from retail price to delivered reliability. When hallucination risk is not perfectly internalized, the standard welfare theorems break down. In high-stakes domains such as law or medicine, this becomes vitally important ([1]). For such users, the disutility from an incorrect answer exceeds by orders of magnitude the service’s sticker price. Users with lower sensitivity to such failures, such as those who use the service for entertainment, may rather treat hallucinations as a nuisance. This raises the question: Can competition and relational contracting alone induce AI agents to verify answers to the standard demanded by high-criticality users, and how does the equilibrium adjust to the mix of high-versus low-criticality demand?

We develop a tractable discrete-time, infinitely-repeated model in which competitive AI agents pick the wholesale model, verification effort, and retail price. Users differ both in the value they place on a correct answer and in their aversion to hallucinations. Relational contracts make costly verification incentive-compatible: the threat of losing future rents disciplines the agent and resolves the moral-hazard problem. Our model yields testable predictions on how market composition shapes agentic AI service quality and pricing.

The verification mechanism we study is akin to relational-incentive contracts ([7]) in that costly, non-contractible effort is enforced by the threat of future lost surplus. In our study, that bilateral logic is embedded in a competitive market whose users differ in their tolerance for hallucinations, so the agent’s informational rent is passed through to prices. Our paper also complements the allocation-of-authority framework by [2]. While they study whether a principal should delegate decision rights to an AI or retain them in-house, we take AI authority as given and analyze the verification effort exerted by a profit-maximizing operator.

The Model

We develop a dynamic economy that features (i) a unit mass of users with heterogeneous valuation and hallucination aversion, (ii) a perfectly competitive continuum of (AI) agents who assemble information services, and (iii) a finite set of upstream providers of models (e.g., LLMs). We model the interaction as an infinitely repeated game where uncertainty arises from the stochastic occurrence of hallucinations.

More precisely, users and agents interact in a competitive market, choosing from a menu of services offered by model providers. Time is discrete, and all parties share a common discount factor δ∈[0,1)\delta\in[0,1). Each user is endowed with a privately observed type θ∈{H(igh),L(ow)}\theta\in\{H(\text{igh}),L(\text{ow})\}, which governs the utility v(θ)>0v(\theta)>0 from a correct answer and the disutility α(θ)>0\alpha(\theta)>0 from a hallucinated answer. We impose v(H)>v(L)v(H)>v(L) and, crucially, α(H)>α(L)\alpha(H)>\alpha(L) to capture the heightened stakes of the segment with high-type users. The population share of HH is μ∈(0,1)\mu\in(0,1).

Each agent is a long-lived firm that chooses a model m∈Mm \in\mathcal{M}, where M\mathcal{M} is publicly known to be finite, to query and a retail price pp to post. Although mm and pp stay the same throughout, the agent chooses its verification effort level in each period, e∈R≥0e \in\mathbb{R}_{\ge0}. Model mm carries a wholesale fee km>0k_m>0 per call and a baseline hallucination probability h0(m)∈(0,1)h_0(m) \in(0,1). We assume m≠m′m \ne m' implies km≠km′k_m \ne k_{m'} and h0(m)≠h0(m′)h_0(m) \ne h_0(m').

Verification effort, chosen by the agent when interacting with a user, lowers the hallucination probability exponentially:

h(m,e)=h0(m)exp⁡(−βe),(1)h(m,e)=h_0(m)\exp(-\beta e), \tag*{(1)}

where β>0\beta>0 denotes verification efficacy. Effort induces a convex cost c(e)c(e) satisfying c(0)=0c(0)=0, c′(e)>0c'(e)>0, and c′′(e)>0c''(e)>0 for all $e>0.

In any interaction, agents first post long-term relational contracts, specified by a model mm and a price per-period pp. Users observe the available contracts and choose one to enter a long-term relationship. Then, in each subsequent period, the user pays pp and the agent chooses an unobservable effort ee. After the service is delivered, a hallucination may occur with probability h(m,e)h(m,e). If a hallucination occurs, the user observes this poor outcome, the relationship terminates, and the user exits the market. If no hallucination occurs, the relationship continues to the next period. In each period, a mass of new, uninformed users enters the market, equal to the mass of users who exited in the previous period, keeping the total population constant.

A user of type θ\theta receives expected per-period utility

Uθ(p,m,e)=(1−h(m,e))v(θ)−h(m,e)α(θ)−p.U_\theta(p,m,e) = (1-h(m,e))v(\theta)-h(m,e)\alpha(\theta)-p.

The total lifetime value to the user from entering the relationship is the expected discounted sum of these per-period utilities:

Vθ(p,m,e)=Uθ(p,m,e)1−δ(1−h(m,e)).(2)V_\theta(p,m,e) = \frac{U_\theta(p,m,e)}{1-\delta(1-h(m,e))}. \tag*{(2)}

The user commits to the relationship if and only if their expected lifetime value is non-negative, Vθ(p,m,e)≥0V_\theta(p,m,e) \ge0.

We analyze equilibria where agents offer a single, unified contract. In equilibrium, this contract must be self-sustaining for the agent and acceptable to all participating user types. An agent’s commitment to effort ee is sustained by the value of the ongoing relationship. The incentive compatibility constraint is then

c(e)≤δ[h(m,0)−h(m,e)]VC,(3)c(e) \le\delta[h(m,0)-h(m,e)]V_C, \tag*{(3)}

where VCV_C is the agent’s present value of relational rents, such that

VC=p−km−c(e)1−δ(1−h(m,e)).V_C = \frac{p-k_m-c(e)}{1-\delta(1-h(m,e))}.

Competition leads agents to lower the price pp until this constraint binds, which yields the minimum price required to sustain effort ee:

p(m,e)=km+c(e)[1+R(m,e)],(4)p(m,e) = k_m+c(e)[1+R(m,e)], \tag*{(4)}

where

R(m,e)=1−δ(1−h(m,e))δ(h(m,0)−h(m,e))R(m,e) = \frac{1-\delta(1-h(m,e))}{\delta(h(m,0)-h(m,e))}

such that c(e)R(m,e)c(e)R(m,e) denotes the agent’s per-period markup (or rent). An equilibrium contract is one that maximizes average user lifetime value, subject to the enforcement price (4) and the participation constraint, Vθ≥0V_\theta\ge0, for θ∈{H,L}\theta\in\{H,L\}.

Results

We analyze the market outcomes under relational contracting, focusing on how the value of reputation enables verification effort in a market with heterogeneous users.

Benchmark: The Spot Market Outcome

We first consider the benchmark where future interactions have no value, i.e., δ=0\delta= 0. For brevity, we let UH(m,p,e)≡Uθ=H(p,m,e)U_H(m,p,e) \equiv U_{\theta=H}(p,m,e) (and UL(m,p,e)U_L(m,p,e) analogously).

Proposition 1. If δ=0\delta= 0, the only sustainable effort level is e∗=0e^* = 0. Competitive agents offer the contract (m∗,p∗)(m^*,p^*) where p∗=km∗p^* = k_{m^*} and the model m∗m^* is the one that maximizes the μ\mu-weighted average of user utilities:

m∗=arg max⁡m∈M{μUH(m,km,0)+(1−μ)UL(m,km,0)}m^* = \underset{m \in\mathcal{M}}{\operatorname{arg\,max}}\{\mu U_H(m,k_m,0)+(1-\mu)U_L(m,k_m,0)\}

The market is active only if this contract is acceptable to both user types.

Proof. When δ=0\delta= 0, the IC constraint (3) implies e∗=0e^* = 0. An agent’s cost thus equals kmk_m, and competition forces the price p∗=kmp^* = k_m. To attract users, agents must offer a contract that provides the highest possible average utility to the market, thus solving for m∗m^* as defined in the proposition. ∎

This benchmark highlights that without the shadow of the future, agents have no incentive to exert costly verification effort, and the quality of service provision regresses to its minimum possible level, e=0e = 0. Competition can only occur over the observable dimensions of baseline model quality h0(m)h_0(m) and its associated cost kmk_m, demonstrating that a mechanism like reputation is essential to solving the underlying moral hazard problem.

The Reputational Equilibrium

When δ>0\delta> 0, agents can exert positive effort. An equilibrium contract must maximize the average user’s lifetime value, subject to the enforcement price (4). This is equivalent to solving a planner’s problem that maximizes the total surplus allocated to users, net of the incentive rents required by the agent (c(e)R(m,e)c(e)R(m,e) discounted). Let vavg(μ)=μv(H)+(1−μ)v(L)v_{avg}(\mu) = \mu v(H) + (1-\mu)v(L) and αavg(μ)=μα(H)+(1−μ)α(L)\alpha_{avg}(\mu) = \mu\alpha(H) + (1-\mu)\alpha(L). The participation constraint becomes Vθ(m,e)≥0V_\theta(m,e) \ge0, where

Vθ(m,e)=(1−h(m,e))v(θ)−h(m,e)α(θ)−p(m,e)1−δ(1−h(m,e)),V_\theta(m,e) = \frac{(1-h(m,e))v(\theta)-h(m,e)\alpha(\theta)-p(m,e)}{1-\delta(1-h(m,e))},

for θ∈{H,L}\theta\in\{H,L\}. The objective is:

max⁡m,e≥0W(m,e)=(1−h(m,e))vavg(μ)−h(m,e)αavg(μ)−km−c(e)1−δ(1−h(m,e))−c(e)R(m,e)1−δ(1−h(m,e)),(5)\max_{m,e\ge0}\quad W(m,e) = \frac{(1-h(m,e))v_{avg}(\mu)-h(m,e)\alpha_{avg}(\mu)-k_m-c(e)}{1-\delta(1-h(m,e))} - \frac{c(e)R(m,e)}{1-\delta(1-h(m,e))}, \tag*{(5)}

subject to participation constraints. To solve this, we first identify which constraint is binding in relation to the equilibrium hallucination probability h∗(m,e)h^*(m,e).

Lemma 1. Let κ=α(H)−α(L)v(H)−v(L)\kappa= \frac{\alpha(H)-\alpha(L)}{v(H)-v(L)} be the sensitivity ratio.

(i) h∗(m,e)>1/(1+κ)⟹VH(p,m,e)<VL(p,m,e)h^*(m,e) > 1/(1+\kappa) \Longrightarrow V_H(p,m,e) < V_L(p,m,e), thus, VH≥0V_H \ge0 is binding.

(ii) h∗(m,e)<1/(1+κ)⟹VH(p,m,e)>VL(p,m,e)h^*(m,e) < 1/(1+\kappa) \Longrightarrow V_H(p,m,e) > V_L(p,m,e), thus, VL≥0V_L \ge0 is binding.

Proof. The ordering of VHV_H and VLV_L is determined by the ordering of the per-period utilities UHU_H and ULU_L. We have UL≥UHU_L \ge U_H if and only if

h(m,e)[α(H)−α(L)]≥(1−h(m,e))[v(H)−v(L)],h(m,e)[\alpha(H)-\alpha(L)] \ge(1-h(m,e))[v(H)-v(L)],

which yields the threshold 1/(1+κ)1/(1+\kappa). The two constraints coincide when h∗(m,e)=1/(1+κ)h^*(m,e) = 1/(1+\kappa). □\square

This leads to our main result stated in Theorem 1, which characterizes the equilibrium for nontrivial discount factors. We first note that an active equilibrium requires that the participation constraint for the binding users, i.e., the LL types, is met. This requires that the per-period utility is sufficient to cover the agent’s rent, i.e., (1−h)vL−hαL−km−c(e)≥c(e)R(m,e)(1-h)v_L-h\alpha_L-k_m-c(e) \ge c(e)R(m,e). Substituting the expression for the rent term R(m,e)R(m,e) and solving for δ\delta yields the condition δ≥δ‾(m,e)\delta\ge\underline{\delta}(m,e), where

δ‾(m,e)≔((1−h)+(h0−h)(1−h)vL−hαL−km−c(e)c(e))−1.\underline{\delta}(m,e) \coloneqq\left((1-h)+(h_0-h)\frac{(1-h)v_L-h\alpha_L-km-c(e)}{c(e)}\right)^{-1}.

Thus, an active market is only sustainable if players are sufficiently patient.

Theorem 1. An active relational equilibrium contract exists if and only if δ≥δ‾(m∗,e∗)\delta\ge\underline{\delta}(m^*,e^*), where the equilibrium is characterized by the unique pair (m∗,e∗)(m^*,e^*). The equilibrium verification effort e∗e^* is strictly increasing in the share of high-type users, μ\mu.

Proof. The equilibrium (m∗,e∗)(m^*,e^*) solves (5) whenever δ≥δ‾(m∗,e∗)\delta\ge\underline{\delta}(m^*,e^*). For given mm, the first-order condition defines an interior solution e∗(m)e^*(m) and precisely formulates the trade-off between generated surplus and agent’s markup such that

dde((1−h)vavg(μ)−hαavg(μ)−km−c(e)1−δ(1−h))=dde(c(e)δ(h0−h)),(6)\frac{d}{de}\left(\frac{(1-h)v_{\mathrm{avg}}(\mu)-h\alpha_{\mathrm{avg}}(\mu)-km-c(e)}{1-\delta(1-h)}\right)=\frac{d}{de}\left(\frac{c(e)}{\delta(h_0-h)}\right), \tag*{(6)}

where h=h(m,e)h=h(m,e) and h0=h0(m)h_0=h_0(m). Uniqueness is guaranteed if ∂2W/∂e2<0\partial^2 W/\partial e^2<0, which holds if c′′(e)c''(e) is sufficiently large. Differentiating the first-order condition with respect to μ\mu, we have

de∗dμ=−∂2W/∂e∂μ∂2W/∂e2.\frac{de^*}{d\mu}=-\frac{\partial^2 W/\partial e\partial\mu}{\partial^2 W/\partial e^2}.

The denominator is negative by the second-order condition. The cross-partial derivative becomes:

∂2W∂e∂μ=βh((vH−vL)+(1−δ)(αH−αL))(1−δ(1−h))2,\frac{\partial^2 W}{\partial e\partial\mu}=\frac{\beta h\left((v_H-v_L)+(1-\delta)(\alpha_H-\alpha_L)\right)}{(1-\delta(1-h))^2},

which is positive as vH>vLv_H>v_L, αH>αL\alpha_H>\alpha_L, β,h>0\beta,h>0, and δ∈(0,1)\delta\in(0,1). It follows that de∗/dμ>0de^*/d\mu>0. □

Our main contributions are twofold. First, the model highlights the trade-off between a model’s baseline hallucination risk, h0(m)h_0(m), and an agent’s verification effort, ee, made visible in both the pricing and equilibrium conditions. Second, the comparative static finding de∗/dμ>0de^*/d\mu>0 delivers a sharp exposition: market composition itself acts as a disciplinary device, in that sectors with higher composition of high-criticality users, such as law and medicine, endogenously generate more heavily verified and consequently more expensive AI services.

Numerical Example

We conclude our analysis with a numerical example. Low-type users gain v(L)=1v(L) = 1 from a correct answer and incur α(L)=1.5\alpha(L) = 1.5 if the answer is hallucinated; high-type users gain v(H)=3v(H) = 3 and lose α(H)=10\alpha(H) = 10. Verification lowers hallucination risk according to (1) with efficacy β=0.70\beta= 0.70 and incurs quadratic cost c(e)=e28c(e) = \frac{e^2}{8}. The discount factor is set to δ=0.95\delta= 0.95. The baseline upstream model (A) features a hallucination probability h0A=0.20h_0^A = 0.20 and wholesale fee kA=0.05k_A = 0.05. A second model, Model B, is such that h0B=0.13h_0^B = 0.13 and kB=0.30k_B = 0.30.

Figure 1a shows that greater patience relaxes the incentive-compatibility constraint, shifting the whole e∗(μ)e^*(\mu) schedule upward, while effort is strictly increasing in μ\mu as established in Theorem 1. Verification plateaus once e∗≈1.97e^* \approx1.97, where the hallucination rate falls below 0.02.

Patience and verification effort

(a) (a) Patience and verification effort. Equilibrium effort e∗e^* as a function of the share of high-type users μ\mu for three discount factors (δ=0.75,0.85,0.95\delta= 0.75, 0.85, 0.95).

Verification-technology comparative static

(b) (b) Verification-technology comparative static. Equilibrium effort e∗e^* as a function of μ\mu for three verification efficacies (β=0.50,0.60,0.70\beta= 0.50, 0.60, 0.70).

Figure 1. Equilibrium verification effort under varying discount factors and verification efficacies.

Figure 1b shows that more effective screening technology lifts the e∗(μ)e^*(\mu) schedule, allowing agents to reach the quality ceiling at lower μ\mu. The result follows from the effort efficacy as in (1).

Figure 2 illustrates the upstream model choice. For μ<0.26\mu< 0.26 agents rely on the cheaper but riskier model and compensate with higher verification effort. When the high-type composition exceeds roughly one-fourth of the market, paying the higher wholesale fee for the cleaner model maximizes surplus, and quality provision shifts from the retail to the upstream layer.

Upstream model choice

Figure 2. Upstream model choice. Notes: Total welfare WW under Model A (h0A=0.20h_0^A = 0.20, kA=0.05k_A = 0.05, solid) and Model B (h0B=0.13h_0^B = 0.13, kB=0.30k_B = 0.30, dashed).

References

  1. [1]Asgari, E., N. Montaña-Brown, M. Dubois, S. Khalil, J. Balloch, J. A. Yeung, and D. Pimenta (2025). A Framework to Assess Clinical Safety and Hallucination Rates of LLMs for Medical Text Summarisation. npj Digital Medicine 8(1), 274.DOI
  2. [2]Athey, S. C., K. A. Bryan, and J. S. Gans (2020). The allocation of decision authority to human and artificial intelligence. AEA Papers and Proceedings 110, 80–84.
  3. [3]Brynjolfsson, E., D. Li, and L. Raymond (2025). Generative AI at Work. The Quarterly Journal of Economics 140(2), 889–942.
  4. [4]Canayaz, M. (2025). AI Agency. Available at SSRN 5109326.DOI
  5. [5]Colback, L. (2025). AI Agents: From Co-pilot to Autopilot. https://www.ft.com/content/3e862e23-6e2c-4670-a68c-e204379fe01f. [Accessed 22-07-2025].
  6. [6]Dahl, M., V. Magesh, M. Suzgun, and D. E. Ho (2024). Large Legal Fictions: Profiling Legal Hallucinations in Large Language Models. Journal of Legal Analysis 16(1), 64–93.
  7. [7]Levin, J. (2003). Relational incentive contracts. American Economic Review 93(3), 835–857.
  8. [8]Rothschild, D. M., M. Mobius, J. M. Hofman, E. W. Dillon, D. G. Goldstein, N. Immorlica, S. Jaffe, B. Lucier, A. Slivkins, and M. Vogel (2025). The Agentic Economy. arXiv preprint arXiv:2505.15799.arxiv.org/abs/2505.15799
  9. [9]Shavit, Y., S. Agarwal, M. Brundage, S. Adler, C. O’Keefe, R. Campbell, T. Lee, P. Mishkin, T. Eloundou, A. Hickey, et al. (2023). Practices for Governing Agentic AI Systems. Research Paper, OpenAI.

Paper details

Contents