Preprint
Article

This version is not peer-reviewed.

When Firms Delegate Tax Decisions to AI Agents: Costly Objective Correction and Executable Compliance Constraints

Submitted:

05 October 2026

Posted:

08 October 2026

You are already at the latest version

Abstract
Tax enforcement can separate the party bearing liability from the system selecting the tax position. We study a firm that delegates reporting to an optimizer whose executable objective only partially incorporates expected sanctions. The owner bears all monetary liability and can correct the objective, but correction consumes resources. A quadratic benchmark delivers explicit reporting, specification and adoption rules. Greater capability can first increase and then eliminate concealment even when sanction pass-through is unchanged: stronger responses to a corrective mandate make endogenous correction more effective. Strict liability implements compliance above a calculable enforcement threshold, but the threshold can exceed that required for direct human choice and need not be feasible under bounded sanctions. Executable certification caps provide an alternative instrument. A cap can lower the default action yet increase concealment relative to an optimally corrected unrestricted system because the owner stops investing in correction. We characterize voluntary compliance certification and a welfare-maximizing cap within the binding-cap regime, accounting separately for lawful service losses, transfers and real costs. Private gates can remove the incremental value of certification. A shared-mandate extension identifies the highest-default contexts that govern complete compliance, while alternative control costs and action curvature show that the capability reversal and finite exact-compliance threshold are not general. The results describe a delegated-optimization friction rather than an intrinsic preference of AI systems, and they do not establish a universal advantage of certification. Numerical illustrations and curvature checks use normalized parameters, not empirical estimates.
Keywords: 
;  ;  ;  ;  ;  ;  ;  

1. Introduction

The person legally responsible for a tax return need not be the proximate decision maker choosing its contents. A firm can instruct a software agent to reduce its tax bill, authorize that agent to execute a sequence of accounting decisions, and receive a report after those decisions have been made. The owner remains the taxpayer. Yet the implemented reporting choice may maximize an executable score that represents only part of the owner’s objective. The economic problem is therefore not simply whether tax advice becomes cheaper. It is how enforcement operates when the party facing sanctions controls a decision rule rather than choosing each tax position directly.
This separation matters even when the owner understands the enforcement rule, anticipates the agent’s response, and bears every monetary sanction. Liability changes the owner’s payoff, but it changes the executed action through the objective and constraints the owner can implement. If including a neglected consequence requires verification, validation or integration resources, liability may induce partial correction rather than exact replication of the owner’s preferred reporting choice. A rational owner can then knowingly tolerate an execution error because eliminating it is costly. Describing this outcome as an AI system wanting to evade taxes would misidentify the mechanism. The system selects the maximizer of its specified objective; the discrepancy concerns what was specified and the cost of changing it.
We construct a deliberately narrow model of this situation. A firm chooses direct human control or delegation. The human chooses an amount of concealed taxable base. Under delegation, the owner chooses a nonnegative compliance weight in an executable objective, after which the agent chooses concealment. The same expected monetary sanction enters the owner’s payoff in full and the default executable objective with a pass-through coefficient. Correction has a convex resource cost. Capability reduces the private resource cost of implementing reporting strategies, while lawful automation services provide a separate adoption benefit. The tax authority commits to enforcement and may offer certification of an executable action cap, accompanied by a reduction in expected sanctions.
The first result is an explicit sequential equilibrium. The implemented action lies between the default agent choice and the owner’s preferred choice at the same technology. The gap is positive when a relevant cost is omitted and correction is costly. Relative to direct human control, delegation combines this gap with the effect of a different technology. This decomposition prevents a common interpretive error: an increase in concealment after automation need not demonstrate a change in moral preferences, and a decrease need not demonstrate perfect objective alignment. Adoption depends on lawful service benefits, implementation costs and the value of the reporting option, rather than concealment alone.
The second result concerns capability. Holding sanction pass-through fixed, improved capability can produce a rise followed by a fall in concealment. This pattern does not require adding a separate legal-understanding effect. If the owner prefers compliance but the default objective understates sanctions, lower implementation costs initially make neglected incentives more consequential. Over a further range, however, the same improvement amplifies the effect of a compliance weight and makes endogenous correction sufficiently effective to eliminate concealment. We derive the turning point and the compliance boundary. The result is conditional on the specified cost-of-correction technology, and the location of both boundaries may lie outside the economically feasible capability range.
The third result identifies the limits of strict liability. A finite expected sanction can implement compliance in the baseline, including when sanctions have zero direct pass-through to the default objective. Owner liability still motivates the owner to correct that objective. The required sanction can nevertheless exceed the direct-choice threshold and exceed a legal or administrative bound. Strict liability is therefore neither automatically sufficient at an existing enforcement level nor fundamentally incapable of regulating delegated actions. The useful question is which threshold is implementable, with what real correction and enforcement costs, and whether adoption remains privately attractive at that threshold.
The fourth result concerns executable constraints. A certification cap is imposed on what the system can implement, rather than merely appended as advice. It can substitute for costly objective correction. This substitution creates a discontinuity in the owner’s choice between using the cap and paying to correct the objective. In a region, a cap below the default action increases concealment relative to unrestricted delegation because the owner chooses zero correction and accepts the cap. A tighter constraint on the default system does not necessarily imply a smaller action in the equilibrium of the owner-system hierarchy. This is the main reason policy analysis must solve both decisions rather than compare two fixed agent objectives.
Finally, we distinguish execution obedience from voluntary deployment. A zero cap makes concealment infeasible, but it implements compliant delegation only when the firm prefers the certified system to both direct control and unrestricted delegation. A reduction in sanctions has no direct monetary value on a perfectly compliant path. Thus penalty relief alone cannot compensate a firm for the lawful service loss from a zero cap. Within a nonempty binding-cap participation region, we derive an exact constrained welfare optimum. Outside that region, policy requires comparison with corrected certified systems and nonadoption. We do not label a within-regime stationary point as a global optimum.
The contribution is bounded by substantial prior work. Tax intermediaries, incomplete objectives, delegation and AI obedience are established topics. The candidate contribution is a tractable tax-reporting application of their interaction through costly objective correction, full owner liability and executable constraints. We derive a nonmonotone capability response and an endogenous-correction effect of a cap, then show why their policy interpretation is conditional. Private gates can dominate certification when they deliver the same constraints more cheaply, and changing the correction technology can remove the capability reversal. A shared-mandate extension identifies the highest-default contexts that govern complete compliance, without claiming that shared investment is a new economic principle. The framework is not uniquely applicable to AI. It also describes other delegated optimizers with the same implementation frictions. Its relevance to firm-side AI arises from the distinction between programmable scores and legal liability, not from any claim that agency problems begin with machines.
The paper proceeds from the human benchmark to the sequential delegation equilibrium, alignment, capability and enforcement. It then analyzes certification and voluntary implementation, develops conditional policy design, and illustrates the mechanisms computationally. All quantitative exercises use normalized examples. They neither estimate the prevalence of autonomous tax reporting nor predict a country’s revenue response. Proofs and implementation details appear in the appendices.

3. Environment and Direct Human Control

There are three decision roles: a firm owner, an executable reporting agent, and a tax authority. The authority commits to a policy before the owner decides whether and how to delegate. The agent is an optimization system, not an economic entity that can pay fines. The owner retains all monetary liability. The owner and system know the true taxable base and all payoff coefficients. The authority does not observe the realized taxable base before an audit; our results condition on a type and a committed enforcement rule, and do not solve elicitation of private income or agent properties. We exclude strategic persuasion and false reports of the installed agent’s properties. Certification later adds a verifiable constraint on execution, not a signal of unknown quality. A cap on actual concealed taxable base is an oracle control assumption: it requires a trusted mapping from underlying records and legal tax status to permissible execution. It is not derived from the authority observing a return, and without such a mapping the certification theorems do not describe an available real-world instrument.
The firm has true taxable income y > 0 and a proportional tax rate τ ∈ ( 0 , 1 ) . The reporting action x ∈ [ 0 , y ] is concealed taxable base. Thus x = 0 means accurate reporting and x > 0 means noncompliance in the model. We do not use x to represent legal avoidance or lawful deductions. Its private implementation cost is k x 2 / 2 , where k > 0 can differ across technologies. The owner also bears a linear nonpecuniary cost h x , with h ≥ 0 . This can represent an internal compliance preference. It is included in owner utility and later in aggregate utility; it is not a second monetary sanction.
An audit occurs with probability p ∈ [ 0 , 1 ] . Conditional on auditing a concealed unit, the authority recovers the unpaid tax and imposes a fine ϕ ≥ 0 per unit of base. Expected monetary liability is
t = p ( τ + ϕ ) .
The analysis uses t as the enforcement instrument. It does not separately optimize p and ϕ , and statements about t hold τ fixed. Any bound t ¯ must therefore be understood as a bound induced by feasible audits and fines. Risk neutrality makes the two instruments equivalent in expected owner payoffs; they need not be equivalent in a richer model with collection risk, audit costs or risk aversion.
Ignoring the common constant ( 1 − τ ) y , owner utility from the reporting action is
f ( x ; k , t ) = ( τ − t − h ) x − k x 2 2 .
Write A = τ − t − h . Direct human control uses k H and chooses
x H = A + k H , v H = A + 2 2 k H .
We impose k H y ≥ τ and, for every delegated technology analyzed, k y ≥ τ . These restrictions make the upper tax-base bound nonbinding for nonnegative compliance mandates. They are substantive restrictions on the capability range, not harmless normalizations. The lower bound remains important: enforcement can make accurate reporting optimal.
An AI system has a default score that incorporates monetary sanctions with coefficient r ∈ [ 0 , 1 ] . The owner can add a compliance weight m ≥ 0 , giving the executable objective
R ( x ; m ) = ( τ − r t − m ) x − k x 2 2 .
The score is expressed in monetary-equivalent units for comparability. It is not the system’s conscious utility, a payment to the system, or a prediction of how a particular language model responds to a prompt. The coefficient r is the marginal pass-through of actual sanctions to the default executable objective. The neglected owner cost is g = ( 1 − r ) t + h ≥ 0 . The owner knows g and can correct it.
Correction consumes real resources
C ( m ) = η m 2 2 , η ≥ 0 .
The primitive is the cost of achieving a verified change in the implemented compliance coefficient, including integration and validation. It does not mean that typing a number into a reward function is expensive. If exact implementation is frictionless, η = 0 and the model collapses to alignment with the owner’s objective at the delegated technology. Larger η means a more expensive correction technology, rather than an exogenously more immoral system.
Delegation also provides a net lawful service benefit B ≥ 0 and requires a fixed real deployment cost F ≥ 0 . These are distinct from reporting gains. The benefit is held outside the concealed tax base and should be interpreted as a net utility-equivalent service surplus, not an untaxed increase in gross firm income. A technology interpretation later sets k = k H / ( 1 + q ) and B = θ q , with q restricted so that k y ≥ τ . This is one illustrative specification rather than an estimated production function.
The timing is: the authority chooses enforcement and any certification offer; the owner chooses direct control or a deployment mode and a mandate; the agent maximizes its executable objective on the allowed action set; and taxes, expected sanctions and real costs are realized. The owner anticipates the response. Once deployed, the owner has no costless action-by-action override. Adding such an override with perfect information would remove the execution wedge and would describe a different decision architecture.
Figure 1. Direct and delegated decision architectures. All monetary liability remains with the owner.
Figure 1. Direct and delegated decision architectures. All monetary liability remains with the owner.
Preprints 236640 g001

4. The Sequential Delegation Equilibrium

Given a mandate, strict concavity of the score implies a unique agent response
x ( m ) = a − m + k , a = τ − r t .
The owner solves max m ≥ 0 { f ( x ( m ) ; k , t ) − C ( m ) } . A mandate above a + never improves the action and can only increase correction cost. If a ≤ 0 , the unmodified agent already reports accurately and the owner uses m = 0 . If a > 0 , it suffices to consider m ∈ [ 0 , a ] . On this interval the owner’s reduced objective is strictly concave, including when η = 0 , because changing m changes a strictly concave reporting payoff.
 Proposition 1
(Reporting and correction). Under the baseline assumptions, the minimum-cost optimal mandate and delegated action are
m U = min a + , g 1 + η k , x U = A + η k a + k ( 1 + η k ) .
The incremental delegated value is v U = f ( x U ; k , t ) − η m U 2 / 2 . If a > 0 and x U > 0 , the specification gap relative to the unconstrained owner target is
x U − A k = η g 1 + η k .
If A ≥ 0 , this is the gap from the feasible same-technology owner choice. If A < 0 , the feasible owner choice is zero and the gap is x U .
The proposition solves the owner decision, not merely the agent decision. The owner does not mechanically select full correction m = g . It selects a smaller correction unless specification is free or the compliance boundary binds. The uncorrected default action is x D = a + / k . The equilibrium satisfies x P ≤ x U ≤ x D , where x P = A + / k . This order follows from omitted costs and one-sided mandates. It would not hold for an arbitrary misspecified objective that is too conservative.
When the owner prefers positive concealment, the gain from using the delegated technology can be decomposed into a technological gain and a correction loss. For A > 0 ,
v U = A 2 2 k − η g 2 2 ( 1 + η k ) .
The second term includes both the remaining action distortion and specification spending. It vanishes as η ↓ 0 , but it need not be small for a technologically sophisticated system. This decomposition clarifies why delegation can be privately unattractive even when the direct implementation cost k falls.
If A ≤ 0 and x U = 0 while a > 0 , delegated compliance is achieved with m U = a . Its reporting value is v U = − η a 2 / 2 , whereas direct human reporting has v H = 0 . The owner therefore adopts only if lawful service benefits compensate deployment and compliance-specification costs. A claim that strict liability implements the same allocation as direct control would have to account for this adoption distortion. Accurate reporting alone does not establish efficient delegation.
 Proposition 2
(Comparison and adoption). Suppose A > 0 and delegation is active. Then
x U − x H = A 1 k − 1 k H + η g 1 + η k .
Consequently, k ≤ k H implies x U ≥ x H , with strict inequality if either component is strictly positive. For unrestricted deployment, AI is weakly privately preferred if and only if
F ≤ F * = B + v U − v H .
Actual unrestricted adoption occurs when F < F * , with equality selected only when x U < x H under our lower-action, then direct-control tie rule. In particular, for k ≤ k H , equality selects direct control. With B = θ q and q > 0 , weak private preference is equivalent to θ ≥ ( F + v H − v U ) / q , subject to θ ≥ 0 ; the strict inequality gives strict adoption preference.
The reporting comparison is conditional on adoption. If F * < 0 , no nonnegative fixed cost permits unrestricted adoption. If A ≤ 0 , direct control gives x H = 0 , and delegated behavior can be either compliant or noncompliant depending on the specification threshold. The formula for adoption remains valid in both cases. Thus the private threshold is useful for organizing the extensive margin, but it is not itself a claim of a new adoption theorem.
The human comparison changes if the delegated technology is more costly, if a certified cap restricts it, or if the default objective overweights compliance. Equation (10) does not imply that all AI use increases aggressive tax behavior. In particular, a certified zero cap can implement the same accurate return while retaining lawful automation benefits; a nonadopting firm stays at the human benchmark. Comparing observed adopters and nonadopters without accounting for their option values would mix selection and execution effects.
Tax rates also require care. Raising τ changes tax savings and, under a fixed audit and fine rule, changes t in equation (1). The derivatives in this paper usually vary one reduced-form parameter while holding the others fixed. They are partial comparative statics, not predictions for every statutory tax reform. Likewise, q affects adoption through both B and v U . A monotone lawful benefit alone is insufficient to establish monotone adoption when reporting and correction values also change.

5. Owner Alignment and Public Compliance

There are two distinct targets. Owner alignment concerns whether execution approximates the owner’s same-technology optimum x P . Public compliance concerns whether execution satisfies accurate reporting, x = 0 . Neither target can be inferred from the other without restrictions on the owner payoff. A delegate can be perfectly aligned with an owner who prefers positive concealment; a compliant owner can deploy a system whose executable objective selects positive concealment.
In the baseline all misspecification omits costs of concealment. This is a directional restriction. Making objective correction cheaper therefore reduces the action. The result should be stated before discussing more general alignment ambiguity, because claiming ambiguity inside a one-sided model would be incorrect.
 Proposition 3
(Alignment in the one-sided model). Holding k , t , r , h fixed, x U is weakly increasing in η. On an active interior branch,
∂ x U ∂ η = g ( 1 + η k ) 2 ≥ 0 .
As η ↓ 0 , x U → x P . A reduction in η weakly increases optimized owner value. Perfect alignment implements public compliance if and only if A ≤ 0 .
The value statement follows directly from the owner’s opportunity set: every mandate becomes weakly cheaper. It does not require an envelope derivative at a boundary. The action statement follows from the explicit formula, including the zero-action branch. Where g = 0 , the default already represents the owner objective and changing correction cost has no effect. Where g > 0 , the active action gap falls with an easier correction technology. The degree of owner alignment can therefore improve while the residual action remains illegal.
For example, let τ = . 4 , t = . 1 , h = 0 and k = 1 . The perfectly represented owner optimum is . 3 . Eliminating an upward execution gap moves the system toward . 3 , rather than toward accurate reporting. This example does not show that better alignment raises concealment in the baseline; it shows that owner alignment stops at a positive concealment target. Distinguishing these two statements is necessary for the model’s interpretation.
An auxiliary signed-bias example establishes the stronger logical possibility. Consider interior targets and a default action x P + δ , where δ may be negative, and let alignment quality λ ∈ [ 0 , 1 ] implement
x ( λ ) = x P + ( 1 − λ ) δ .
Then distance from the owner’s target falls with λ , while ∂ x / ∂ λ = − δ . If the default is more conservative than the owner, δ < 0 , better alignment increases concealment. With x P = . 3 and δ = − . 1 , the action rises from . 2 to . 3 . This is a separate interior extension, not a comparative static proved for equation (4). We do not use it to overturn Proposition 3.
The distinction can be summarized in four cases. A compliant owner and a well-aligned system can produce accurate reporting. A compliant owner and an upward-biased system can produce noncompliance despite the owner’s preference. An aggressive owner and a well-aligned system implement the owner’s aggressive choice. An aggressive owner with a conservative system may produce less concealment than the owner intends, and reducing that conservatism can worsen compliance. The last case requires an objective distortion outside the baseline’s omitted-cost restriction.
From a regulatory perspective, an instruction to represent the owner’s preferences faithfully is therefore incomplete. It regulates the first relationship in the owner-agent-authority hierarchy but leaves the owner-authority conflict intact. Conversely, a binding compliance constraint may improve public compliance while deliberately preventing the system from implementing the owner’s unconstrained target. There is no contradiction: the two assessments use different objectives. The model retains familiar incentive analysis and makes the implementation map explicit, rather than inventing a new ethical preference for the system.

6. Capability and Endogenous Correction

Capability is modeled as a decline in k, the resource cost of executing concealment strategies. Under k = k H / ( 1 + q ) , higher q raises the response to any fixed marginal incentive in the score. We hold r fixed in the principal result. Thus improved legal interpretation is not needed to generate ambiguity. The allowable range of q is bounded by k H / ( 1 + q ) ≥ τ / y .
Holding the mandate fixed would yield the familiar opportunity effect: whenever a − m > 0 , reducing k raises x ( m ) . But the mandate is chosen by a liability-bearing owner. The same reduction makes a unit of correction change the action more strongly. As a result, the comparative static of the sequential equilibrium can differ from the comparative static of the fixed score.
 Proposition 4
(Capability can generate a turning point). On an active interior branch, with a > 0 and η > 0 ,
∂ x U ∂ k = − A ( 1 + 2 η k ) − η 2 k 2 a k 2 ( 1 + η k ) 2 .
If A ≥ 0 , reducing k weakly raises concealment. If A = − c < 0 , concealment is positive exactly when k > k 0 = c / ( η a ) . In that region it is maximized at
k peak = c + c 2 + a c η a > k 0 .
Along a decline in k, concealment rises above k peak , falls between k peak and k 0 , and equals zero below k 0 . A full inverted-U path exists only if the feasible technology range crosses these boundaries.
For a compliant owner, A < 0 , private correction is valuable because any positive action reduces the owner’s reporting payoff. Initially the system’s response is weak and the owner tolerates a small action rather than purchase expensive correction. A capability improvement can increase that action. Eventually, however, further improvement makes the score more responsive to a compliance weight, and the owner can reduce the action substantially with a modest additional weight. At k 0 , the chosen weight reaches the minimum needed for accurate reporting. Capability improves the effectiveness of controlling the agent as well as the effectiveness of executing its default objective.
The turning point is not produced by a change in the owner’s compliance preference or in statutory liability. It follows from the joint optimization of action and score. The quadratic cost places specification resources on the compliance coefficient m, not directly on the reduction in concealment. Alternative correction technologies can change the pattern. That qualification is central: if correction cost were specified as a function only of the final action gap, changing k could have a different effect. We later report numerical checks for different action and correction curvatures, without claiming a universal comparative-static theorem for all such technologies.
The effects on adoption and welfare also differ from the effect on concealment. For any fixed mandate with no binding upper bound, the owner’s reduced reporting value satisfies an envelope derivative
∂ v U ∂ k = − x U 2 2 − x U k A − k x U = − x U 2 2 + x U η m U on the interior branch .
The final equality uses A − k x U = − η k m U . Its sign is not fixed. A lower physical implementation cost can worsen owner value when it amplifies an incompletely corrected objective. Adding a growing lawful service benefit B ( q ) can offset that effect, but cannot be assumed to do so for every type. The threshold in Proposition 2 must therefore be recomputed after the mandate changes.
Treasury receipts provide another distinction. Gross expected receipts are τ y + ( t − τ ) x . Initial tax collections decline when concealment increases, but expected receipts including recovered taxes and fines need not decline if t > τ . This arithmetic is not a welfare justification for encouraging concealment. The collection of a fine is a transfer, while implementation and correction consume resources. An authority maximizing receipts alone and a planner maximizing aggregate utility can prefer different policies.
Improved legal understanding can be added through r = r ( q ) with r ′ ( q ) ≥ 0 . On the active branch, ∂ x U / ∂ r = − η t / ( 1 + η k ) ≤ 0 . This is a separate pass-through channel that adds to the cost channel rather than determining its sign in advance. Better capability should therefore be described through its specific technological effects. Neither “stronger AI always evades more” nor “better AI necessarily complies better” is supported without a maintained mapping from capability to the objective and correction technology.

6.1. Shared Correction Across a Batch of Decisions

The scalar benchmark describes one deployment mandate. Software deployment can instead reuse a verified objective across many decisions. This extension makes that reuse explicit while preserving the distinction between score and liability. The economic property is shared control, which can also apply to standardized human procedures; software interpretation alone does not establish mathematical uniqueness to AI.
Consider contexts i = 1 , … , J , each repeated with positive weight n i . A common correction m ≥ 0 is installed once at resource cost η m 2 / 2 . Context i has default marginal score a i > 0 , action curvature k i > 0 , and owner reporting payoff − c i x i − k i x i 2 / 2 , where c i ≥ 0 . Thus every context’s owner target is accurate reporting. The system executes x i ( m ) = a i − m + / k i . Upper-base bounds are assumed nonbinding in each context. The owner maximizes
V ( m ) = ∑ i n i − c i x i ( m ) − k i x i ( m ) 2 2 − η m 2 2 .
No new strategic information is introduced. What changes is that the same verified coefficient governs several execution margins, and its resource cost is paid once.
 Lemma 1
(A shared mandate and the highest-default tail). Let a max = max i a i . In the batch problem the selected least mandate achieves accurate reporting in every context if and only if
∑ i : a i = a max n i c i k i ≥ η a max .
For n identical contexts with c > 0 , this becomes n ≥ η k a / c , and the single-context equilibrium uses effective correction cost η / n . In a heterogeneous batch, adding contexts with strictly smaller default scores does not change the necessary and sufficient all-context compliance condition, unless it changes the maximum default score or its contexts’ weights.
To see the mechanism, the marginal benefit of correction sums over contexts whose actions remain positive. Once a lower-default context reaches accurate reporting, it contributes no marginal benefit to increasing the common mandate further. Near a max , only the highest-default contexts remain active. Their frequency and owner loss, rather than the total number of deployed decisions, determine whether paying for the last correction increment is worthwhile. Adding routine contexts can reduce active actions while leaving a rare high-default reporting context noncompliant. This extension conditions on deployment: it does not include a batch adoption benefit or fixed deployment cost and proves no batch adoption threshold.
This result qualifies a simple scale-economy account of alignment. Reusing an objective amortizes its fixed validation cost in a homogeneous deployment. But the number of routine compliant contexts is not sufficient to establish complete reporting compliance in a heterogeneous deployment. A common objective is evaluated at its remaining active margins. The result depends on a shared correction coefficient and the nonpositive owner marginal payoff in every context. If separate context-specific objectives can be verified freely, or if some owner targets favor positive concealment, the stated concavity and threshold need to be reconsidered.
An illustration has a 1 = . 2 , c 1 = . 2 , k 1 = 1 , a 2 = . 4 , c 2 = . 02 , k 2 = 1 , η = . 5 , and one high-default context. The selected mandate is . 28 , making the low-default action zero and the high-default action . 12 . Increasing the count of the already compliant low-default context from one to one thousand changes neither action nor mandate: the all-context condition remains . 02 ≥ . 2 , which fails. In a homogeneous deployment instead, the amortized-cost logic applies. These are deterministic deployment illustrations, not frequencies of actual reporting tasks.
The extension narrows the candidate contribution further: reusable objective correction can yield an intensive-margin compliance bottleneck that aggregate adoption or total decision scale does not reveal. Neither the principle of shared investment nor heterogeneous control is claimed to originate here. Its application to a liability-bearing tax-reporting deployment requires both the marginal payoff condition and an explicit implemented score.

6.2. Which Parts of the Capability Result Survive Alternative Technologies?

The coefficient-cost assumption is consequential. Suppose instead that resources are charged to the induced action reduction: C ( m , k ) = ζ ( m / k ) 2 / 2 , with ζ > 0 . The effective coefficient-cost parameter is then η ( k ) = ζ / k 2 . For a > 0 the equilibrium action becomes
x = A k + ζ a + k ( k + ζ ) .
When A = − c < 0 , its active region is k < ζ a / c , and reducing k strictly increases concealment there. The earlier improvement to exact compliance as k falls disappears. The original inverted-U is therefore a result about verified coefficient correction, not a general theorem about costly alignment. Action-based control costs constitute a precise counterexample to its unrestricted interpretation.
Curvature also matters for exact compliance. With action cost k x ν / ν , ν > 1 , the system response is x ( m ) = ( a − m ) / k + 1 / ( ν − 1 ) . Suppose the owner prefers compliance, A = − c ≤ 0 , and correction is differentiable with C ′ ( a ) > 0 . If 1 < ν < 2 , exact compliance at m = a cannot be optimal for any finite parameters while a > 0 . Reducing the mandate to a − ϵ saves C ′ ( a ) ϵ + o ( ϵ ) in resources, whereas the reporting loss is c ( ϵ / k ) 1 / ( ν − 1 ) + ( k / ν ) ( ϵ / k ) ν / ( ν − 1 ) = o ( ϵ ) . A small positive action is therefore strictly preferable.
Consequently, when r = 0 and a = τ > 0 , no finite monetary sanction implements exact zero concealment in that subquadratic extension, even though it can make the residual arbitrarily small under suitable parameters. For r > 0 , sufficiently large sanctions can still make the uncorrected default a ≤ 0 ; the impossibility concerns a positive default incentive. For ν > 2 and c > 0 , the leading reporting loss from a small deviation away from compliance dominates the linear correction saving, making compliance locally attractive; that observation alone does not establish the global optimum or a continuous threshold.
These analytic restrictions are more informative than a generic numerical robustness label. The numerical curvature exercises describe particular paths, while the exact-zero and continuity claims remain attached to the quadratic benchmark. Enforcement comparisons must distinguish legally exact reporting from arbitrarily small residual concealment. Both can matter, but they are different implementation targets.

7. Strict Liability and Bounded Enforcement

The baseline already imposes strict monetary liability: the owner pays every expected back-tax and fine associated with the implemented action. The difficulty is not assigning a fine to a machine. It is translating the owner’s liability into an executed choice. Raising t changes both the owner’s desire to correct the objective and, through r, the default score. Treating only the second channel would incorrectly imply that enforcement cannot affect a system with r = 0 .
 Proposition 5
(The enforcement threshold). For unrestricted delegation, accurate reporting is implemented if and only if
t ≥ t A = max 0 , τ ( 1 + η k ) − h 1 + η k r .
Direct control implements accurate reporting at t H = τ − h + . If τ > h , then
t A − t H = η k [ τ ( 1 − r ) + r h ] 1 + η k r ≥ 0 .
With feasible sanctions t ∈ [ 0 , t ¯ ] , continued unrestricted deployment can be made compliant exactly when t ¯ ≥ t A . This is an execution condition conditional on deployment, not a guarantee that deployment is optimal.
The threshold is finite for all baseline parameters, even when r = 0 . In that case t A = τ ( 1 + η k ) − h + . A large sanction motivates the owner to pay for correction despite its absence from the default score. The condition exposes two errors that pull in opposite directions. Full owner liability at the human threshold does not necessarily implement compliance under delegation. Yet inability to encode the sanction automatically does not make owner liability completely ineffective when the owner can choose a compliance weight.
When η = 0 , enforcement need only align the owner’s reporting incentive; the delegated choice reproduces the same-technology owner optimum. When r = 1 and h = 0 , the default score already represents monetary liability and the threshold is the human threshold for any correction cost. When r = 1 but h > 0 , the default still omits the owner’s nonpecuniary preference, so a threshold difference may remain. The case h ≥ τ is also instructive: the human reports accurately without monetary enforcement, while a delegated system may require correction or positive enforcement if omission of h matters.
Penalty feasibility is not equivalent to social optimality. Realistic legal regimes may cap fines, limit collection from insolvent firms, or impose proportionality requirements; the model summarizes any resulting restriction as t ¯ . It does not derive those legal limits or provide jurisdiction-specific advice. Nor does it claim that extremely large nominal fines are free. An enforcement cost K ( t ) can be included in welfare. A finite mathematical threshold may therefore be legally infeasible, administratively expensive, or privately unattractive because the firm exits delegation before reaching it.
At the compliance threshold, reporting may still require a positive mandate. If a > 0 , the least-cost compliance mandate is m = a , and the owner spends η a 2 / 2 . A planner with a direct, costless ability to constrain the action could avoid that cost. Strict liability can implement the compliant action while failing to implement the planner’s preferred mix of deployment and resources. We therefore avoid the phrase “strict liability achieves the first best” unless a first-best benchmark specifies all these costs and available instruments.
The threshold supplies a useful way to compare liability and objective requirements. Raising r lowers t A whenever its numerator is positive. Requiring that a verified executable objective include a larger share of expected sanctions can economize on monetary enforcement. That statement assumes verification is feasible and does not charge a separate regulatory cost for increasing r. If verification is costly, its cost must enter policy comparisons; if systems can misrepresent r, a separate information and certification problem arises. Neither issue is solved by labeling the objective “aligned.”
Enforcement can also change the deployment mode. A firm may abandon unrestricted delegation, switch to a constrained system, or retain a system with more correction. The total reporting response therefore contains an extensive margin. A discontinuity in adoption is not a failure of the within-mode derivative. It is a consequence of comparing optimized option values. Our implementation analysis keeps those concepts separate: Proposition 5 concerns the action of an unrestricted deployment, while later participation conditions determine whether that deployment occurs.

8. Certification and Endogenous Correction

A certified system has an enforceable cap b ∈ [ 0 , b ¯ ] , with b ¯ > 0 , on concealed base and may receive expected monetary-liability relief s ∈ [ 0 , t ] . Its owner faces t C = t − s . Because t includes recovered tax, this range can describe more than fine relief. If relief changes only fines at fixed audit probability, its feasible domain must instead satisfy s ≤ p ϕ , so t C ≥ p τ . We do not optimize that institutional implementation or its enforcement cost. A positive cap is a tolerance counterfactual for a noncompliant margin, not a certificate that concealment is lawful; only the zero cap guarantees compliance. The cap is enforced in execution: the system cannot choose x > b . The authority does not use a noisy classifier to infer whether the system is safe. We assume the cap can be verified and cannot be bypassed. This strong assumption isolates constraint design and leaves imperfect certification for future work.
The certified response is
x C ( m ; b , s ) = min b , a C − m + k , a C = τ − r t C .
The owner still chooses m. A cap reduces the default action, but it can make a range of positive mandates redundant. If b < a C / k , every m ∈ [ 0 , a C − k b ] yields the same capped action. Because correction costs are nonnegative, the owner chooses m = 0 within that range. If it wishes to reduce the action below b, it must purchase enough correction to cross the range first.
This creates two economically distinct options. The first is the unmodified capped system, with x 0 = min { b , a C + / k } and reporting value f C ( x 0 ) , where f C ( x ) = ( τ − t C − h ) x − k x 2 / 2 . The second, if feasible below x 0 , is the unconstrained corrected solution computed at t C . The owner compares their values. Replacing x U mechanically by min { b , x U } would miss the zero-correction option and generally solve the wrong hierarchy.
 Proposition 6
(The cap-correction switch). Fix s and suppose a C > 0 . Let ( x U C , m U C , v U C ) be the unrestricted solution at t C , and A C = τ − t C − h . The certified optimum is the better of the zero-mandate capped outcome and the unrestricted corrected outcome when x U C < x 0 . For b ≤ a C / k , define
b sw = min a C k , A C + A C 2 − 2 k v U C k .
For 0 ≤ b ≤ b sw , the selected optimum has m C = 0 and x C = b . For b > b sw within [ 0 , a C / k ] , when this interval is nonempty, the owner selects the corrected solution. At the switch both options are optimal; within a deployment mode we select the smaller correction expenditure, hence the unmodified cap. If m U C > 0 , x U C > 0 and b sw > x U C , any cap b ∈ ( x U C , b sw ) increases concealment relative to corrected unrestricted deployment despite reducing the default action.
The discriminant is nonnegative because v U C cannot exceed the owner’s unconstrained maximum reporting payoff. The upper root is at least x U C : at the corrected action, the unmodified reporting payoff is v U C + C ( m U C ) . Thus a cap just above that action can save correction costs while allowing a slightly worse reporting choice. The owner prefers this tradeoff over a nonempty interval whenever correction is strictly costly and the interior action is positive. If correction is free, the interval collapses. If unrestricted correction already achieves zero, a positive cap can still crowd out correction, but the particular positive-action comparison above is not its stated domain.
For a concrete example, let τ = . 4 , t = . 2 , r = 0 , h = 0 , k = 1 , η = 1 and s = 0 . Unrestricted delegation gives m U = . 1 and x U = . 3 , whereas the default action is . 4 . A cap b = . 32 yields m C = 0 and x C = . 32 . Its reporting value is . 0128 , compared with . 0100 for the corrected unrestricted system. The cap therefore raises concealment by . 02 while saving the specification cost. The comparison conditions on adoption and excludes any separate certification cost or lawful service loss, which must be included before drawing a policy conclusion.
Certification can remove lawful services as well as risky actions. We model that technological co-restriction by
L ( b ) = L 0 1 − b b ¯ 2 , L 0 ≥ 0 ,
on [ 0 , b ¯ ] . A tighter cap produces a greater loss of useful automation. The loss is an assumption about imperfect filtering of permissible and impermissible operations, not a benefit of tax evasion. It could arise if disabling a broad execution pathway also removes legitimate accounting functions. The paper does not claim that every implementation of a reporting cap has this property. If lawful services can be preserved at zero cost, set L 0 = 0 .
Let K C ≥ 0 be a real private certification cost. Certified deployment has option value B − F − K C − L ( b ) + v C ( b , s ) . The statutory sanction discount is not a subsidy paid to the system. At positive concealment it changes expected payments by the owner; at zero concealment it has no realized value. This distinction becomes decisive for voluntary compliant deployment and prevents a safe-harbor label from being treated as an automatic participation benefit.

9. Voluntary Implementation and Conditional Policy Design

Define the best uncertified option value
v O = max { v H , B − F + v U , V P G , V H Y } .
Here V P G is the best privately available gate option, set to minus infinity only when that option is technologically unavailable. With gate cost K P ( b ) , it equals B − F + sup b ∈ [ 0 , b ¯ ] { v C ( b , 0 ) − L ( b ) − K P ( b ) } . Private gates receive no sanction discount. The analytical participation and cap-design formulas use this outside value unchanged; the original numerical baseline conditions on no additional private gate, and separate gate-availability checks expose its importance. The additional option V H Y = B − F + v H − H retains lawful AI services but leaves reporting with the human, at supervision cost H ≥ 0 ; set it to minus infinity only if the workflow does not permit separation. The analytical formulas retain their form with this larger outside value. A zero-cost hybrid can dominate costly reporting delegation for a compliant owner. Excluding it requires workflow bundling or a positive supervision cost, neither of which follows from the existence of an AI system. Our baseline figures condition on its unavailability, and a separate mode comparison varies H. This outside option includes nonadoption. A regulator cannot assume that firms continue to use an expensive compliant system when direct control is available. Nor can it declare implementation merely because an eligible certified agent obeys a cap. The deployer must choose that mode in the first place.
We use “agent-compatible enforcement” descriptively for a policy whose induced deployed-system choice meets the reporting target. In this model, implementation has familiar sequential conditions: owner participation and system obedience. The system’s obedience condition is optimization of a known score within an executable feasible set, not truth-telling about private information. These are not a new solution concept, and the phrase “dual incentive compatibility” would not by itself add a theoretical result. For weak implementation we explicitly select certification when it ties the best private value. Among uncertified modes we select the smaller action, then direct control. Strict participation is required for implementation independent of this convention.
 Proposition 7
(Voluntary compliance certification). A certified zero cap implements compliant delegation if and only if
B − F − K C − L 0 ≥ v O ,
under the stated tie rule. The agent’s feasible set then consists only of x = 0 , and its minimum-cost owner mandate is m = 0 . Expected sanction relief s has no direct value on this path. More generally, voluntary certified deployment requires B − F − K C − L ( b ) + v C ( b , s ) ≥ v O as well as the agent response in equation (22).
The zero-cap condition can be read as two inequalities. Against direct control, lawful benefits must cover deployment, certification and service losses plus the human reporting value. Against unrestricted delegation, the avoided reporting and correction loss must cover certification and lawful service losses. The latter comparison cancels B and F because both AI modes deliver the common gross benefit and require the common deployment cost. High service demand can make delegation attractive relative to human control without making certification attractive relative to an unrestricted system.
Equation (26) also shows when strict liability and certification complement one another. If monetary enforcement makes the unrestricted reporting option sufficiently unattractive, an executable zero cap can save costly correction and become privately preferred. This does not require paying fines to the agent. Conversely, a zero cap with a large lawful service loss may fail participation even when it is mechanically effective. A proposal that solves only the execution condition is incomplete.
For welfare, expected treasury receipts net of enforcement resources are
T ( x ) = τ y + ( t z − τ ) x − K ( t ) ,
where t z is the sanction applicable to the chosen mode and K ( t ) is a real enforcement cost. Adding owner utility and treasury receipts cancels tax payments and fines. Let concealment create an additional public harm H ( x ) = d x + D x 2 / 2 , with d , D ≥ 0 . Resource welfare for a certified deployment is
W C = y + B − F − K C − L ( b ) − k x C 2 2 − η m C 2 2 − ( h + d ) x C − D x C 2 2 − K ( t ) .
The same formula applies to other modes with their appropriate technology, benefits and costs. The nonpecuniary owner cost is counted once; additional public harm is separate. Without a positive public harm or a revenue shadow value, the baseline still has wasted concealment resources. We do not identify the entire unpaid tax with a social resource loss and then count that transfer again.
Consider the zero-correction binding-cap branch, at a fixed t and s. On this branch x C = b , m C = 0 , and private certified value is a concave quadratic in b. Put Q = k + 2 L 0 / b ¯ 2 , J = A C + 2 L 0 / b ¯ , and E = B − F − K C − L 0 − v O . The participation condition is E + J b − Q b 2 / 2 ≥ 0 . Its intersection with the branch domain is an interval, when nonempty.
 Proposition 8
(The constrained cap optimum). Suppose a C > 0 and b ¯ > 0 . Let I = [ b − , b + ] be the nonempty weak-participation interval intersected with [ 0 , min { b ¯ , a C / k , b sw } ] , under certification priority at private-value ties and zero correction at within-mode ties. At fixed enforcement and relief, the welfare-maximizing weakly implemented cap within this branch is
b * = proj I 2 L 0 / b ¯ − h − d k + D + 2 L 0 / b ¯ 2 .
If J 2 + 2 Q E ≥ 0 , the participation roots before intersection are ( J ± J 2 + 2 Q E ) / Q . If the intersection is empty, this branch implements no certified outcome. The proposition is conditional on the branch and on fixed ( t , s ) ; it is not a global optimum across all modes and enforcement policies.
The unconstrained stationary point balances the marginal recovery of lawful services from loosening the cap against concealment resources and harms. Participation can push the cap away from that point. A zero cap is optimal in the branch only if the numerator is nonpositive or the feasible interval constrains the optimum to zero. When certification removes substantial lawful services, a positive cap can maximize resource welfare within the specified technology. That conclusion depends on the maintained co-restriction L ( b ) and does not authorize unlawful conduct as a legal policy prescription.
Global policy analysis must also compare the corrected certified branch, unrestricted delegation and direct control, and include enforcement costs. At a branch switch the owner may have multiple optimal actions. Within a mode we select the smaller correction expenditure; at equal private values across modes we select certification. These conventions make weak endpoint implementation precise. They do not establish implementation for arbitrary tie-breaking. With strict participation the feasible interval can be open, and a welfare supremum at its boundary need not be attained. In such a case equation (29) describes a weakly implemented optimum or the limit of feasible interior caps, not an attained strict optimum.
Sanction relief is potentially relevant for positive-cap participation but cannot be presumed welfare improving. It can reduce correction, increase concealment, or change which firms certify. Because transfers cancel, its welfare effect operates through choices and real costs. The optimal cap formula therefore conditions on relief rather than silently assuming the maximum discount is desirable. A richer instrument set could include audit-cost relief or a deployment subsidy, but those are different mechanisms and are not introduced here merely to ensure that certification works.

10. Computational Illustrations and Stress Tests

These exercises illustrate the theoretical mechanisms and should not be interpreted as empirical estimates. No proprietary, administrative or firm-level dataset is used. Parameters are normalized, and the displayed examples are chosen to expose theoretical regions rather than match an observed economy. The seed is 20261003. Computation supports debugging and illustration; it is not the proof of any proposition.
The central illustration sets y = 1 , τ = . 4 , t = . 7 , h = 0 , r = . 1 , η = 1 and k H = 4 . Capability varies through k = 4 / ( 1 + q ) over q ∈ [ 0 , 7 ] , satisfying the upper-bound restriction. The owner prefers accurate reporting because A = − . 3 . The default score still rewards concealment at the margin because a = . 33 . The compliance boundary is k 0 = . 3 / . 33 ≃ . 9091 , and the turning point is ( . 3 + . 3 2 + . 33 × . 3 ) / . 33 ≃ 2.2265 . Thus the turning point and the zero-action boundary both lie within the plotted technology range. Their corresponding capability values are q ≃ . 7965 and q = 3.4 .
Figure 2 shows the implied action path. The lower-pass-through series first rises and then declines to zero. Increasing pass-through to . 4 changes the relevant default incentive and reduces the action; it is not a separate dataset or a calibrated regulatory experiment. The graph illustrates Proposition 4, while the formula determines the boundaries exactly. A plot at a technology range excluding the turning point would show only one part of the same mechanism.
Figure 3 varies the lawful service coefficient in B = θ q . It displays F * = B + v U − v H , including negative values. We preserve those values instead of truncating them at zero, because a negative threshold means that even costless deployment is privately unattractive. The reporting-value term can fall when an upgrade magnifies an inadequately represented objective. A sufficiently large service benefit eventually makes delegation attractive, but the curves are illustrative comparative statics, not adoption forecasts.
Figure 4 varies correction cost at fixed technologies and two enforcement levels. The positive-action owner target under weak enforcement differs from the zero target under stronger enforcement. Both series move toward their respective owner targets as correction becomes cheaper. This figure deliberately does not illustrate the signed-bias counterexample, which belongs to a different objective environment. Combining those examples on a single unqualified “alignment quality” axis would obscure their different assumptions.
Figure 5 evaluates the difference between delegated and direct compliance thresholds over r ∈ [ 0 , 1 ] and η ∈ [ 0 , 6 ] , with k = 1 and h = 0 . Its zero boundary at r = 1 reflects complete inclusion of monetary consequences. The figure compares expected enforcement levels, not fine rates, audit probabilities or monetary revenue. To convert a plotted level into an audit-fine policy, equation (1) must be applied together with any feasible limits on its components.
Figure 6 uses the crowding-out example in the certification analysis. The implemented action follows the cap while the owner uses zero correction. Above the switching boundary it falls to the corrected action. This discontinuity is a change in the selected optimum of a continuous owner problem with a kinked agent response. At the exact switch we use the lower-expenditure tie rule. The result should not be read as an estimate of how a particular certification program would behave.
For the conditional design exercise, use B = . 4 , F = . 02 , K C = . 005 , L 0 = . 02 , b ¯ = . 4 , d = . 03 and D = . 5 , with the central reporting parameters and zero relief. The participation interval within the cap branch is approximately [ 0 , . 1090 ] . Equation (29) yields b * = . 04 , which is strictly inside that interval. Figure 7 displays owner participation and resource welfare. The baseline excludes an additional private gate option. When that option is included, a zero-cost private gate has value . 36 and selects zero concealment, exceeding the offered certificate value . 346 . At private gate costs . 02 and . 08 , the same certificate is chosen instead. These separate checks expose the participation effect of control availability. The example avoids relying on an indifference endpoint for its selected optimum. It does not compare every possible enforcement or relief policy.
Figure 8 compares an offered cap . 05 with the best uncertified deployment mode over lawful-service losses and additional public harms. The left panel conditions on private gate and hybrid unavailability. The right panel makes the identical cap technology privately available without a separate gate fee, retaining the same lawful-service loss. With no liability relief and a positive certification surcharge, certification is then dominated at every plotted point and its offer changes neither the mode nor welfare. A separate hybrid check finds that retaining lawful services with human reporting yields value . 38 − H ; it is selected at H = 0 and . 01 , while the certificate is selected at H = . 05 and . 1 . Owner selection is recomputed at every parameter pair. The gain can be zero because the firm declines the offer, positive because correction resources are saved and concealment falls, or negative where the selected certification arrangement sacrifices services without sufficient offsetting gains. The comparison counts fines as transfers and uses k H for a human-selected outcome. A policy is not evaluated as if every eligible firm necessarily adopted it.
We also draw 12,000 independent illustrative parameter vectors. The tax rate lies between . 05 and . 85 , expected liability between zero and three, the owner cost between zero and . 5 , k between τ and five, correction cost between . 001 and twelve, and pass-through between zero and one. All vectors satisfy the nonbinding upper-base restriction. The sweep checks the equilibrium formula, the sign of the correction-cost derivative and the sign of the within-mode enforcement response. It also records both signs of the capability response.
At 800 vectors, an independent bounded numerical optimization over the mandate is compared with the closed-form owner value. The maximum value difference in the recorded run is 2.22 × 10 − 16 . This is a floating-point consistency check, not evidence that the assumptions hold in practice. The randomized sweep records 3,442 cases in which a small capability increase raises concealment, 537 in which it lowers concealment, and 8,021 with no detected change at the specified tolerance. These frequencies depend on arbitrary parameter-drawing ranges and are not economically meaningful prevalence estimates.
Curvature checks replace the quadratic action cost by k x ν / ν and specification cost by η m γ / γ , varying ν over 1.5 , 2 , 2.5 , 3 and γ over 1.5 , 2 , 3 . The algorithm evaluates a global grid and refines its highest-value neighborhood, including boundary values. These checks ask whether the rise-and-fall mechanism survives particular alternatives; they do not prove that the same derivative or turning point survives arbitrary convex costs. Exact random-grid values, curvature summaries and counterexamples are saved with the reproduction package.
Separate tests verify the owner-agent transfer identity, compliance boundaries, the zero-cost alignment limit, cap-induced correction crowding out, and conditional policy participation. The cap checks compare the analytical branch solution against dense mandate grids that cross the response kink. Test failures would require revising the implementation or the theorem domain. Successful tests cannot replace the full proofs, especially at boundaries and policy indifference points.

11. Interpretation, Institutional Limits and Research Extensions

11.1. AI Agents and Human Tax Advisers

The model does not establish that AI introduces an agency problem absent from human advice. Expert intermediaries have long separated legal taxpayers from the people selecting tax positions. A human adviser can also implement an aggressive recommendation for a compliant owner, omit consequences from a fee-based objective, or respond to professional restrictions. The fact that an owner faces liability while a delegate chooses an action is therefore insufficient to distinguish machine delegation from traditional preparation.
The more specific interpretation concerns how the delegate is controlled. A human adviser can have consumption utility, career concerns, professional sanctions, reputational capital and effort incentives. The optimizer here has none of those additional payoff components. The owner changes a score coefficient or an executable action set and pays resources to make that change reliable. Marginal execution improvements affect the response to both neglected and corrective incentives. The paper’s results apply to a human reduced form if it exhibits exactly the same mappings; they are not proof of an essential difference between biological and software decision makers.
That limitation is also a useful discipline. A claim that AI makes tax advice infinitely scalable or nearly costless would require a production model and supporting evidence. We do not infer such properties from a scalar reduction in k. The shared-mandate extension includes repeated contexts and pooled correction; it remains static and excludes learning across executions. Scale economies in provider production are not modeled. Similarly, the agent’s provider might choose a default objective for commercial reasons. Provider incentives could change r, η and certification supply, but the provider is not an actor in the baseline.
The exact meaning of m deserves emphasis. It is a verified marginal compliance coefficient, not the length of a prompt, the strength of moral language or an agent’s subjective attitude. A change in a natural-language instruction may not generate a stable change in an executed objective. Empirical work could examine whether deployment controls produce such a mapping and what resources it takes to validate it. If the mapping is uncertain, the owner faces a stochastic control problem rather than the deterministic hierarchy studied here. The present theorems should not be exported to that setting without new assumptions.

11.2. Certification, Safe Harbors and Accountability

The same executable gate may be available privately. Certification is not presumed to create a technological control that owners cannot otherwise buy. If private and certified gates have the same service losses and execution costs, certification must be compared against that private option. In particular, a zero cap with no monetary liability on its path gives sanction relief no advantage over an otherwise identical private zero gate; a positive certification surcharge makes it strictly dominated. Any advantage from cheaper public validation infrastructure is a separate cost assumption, not an automatic consequence of the certification label.
An executable cap is a demanding regulatory instrument. A documentation requirement or a provider label does not automatically restrict actions. If a system can evade the gate, if the owner can relabel an unrestricted deployment, or if certification is based on imperfect tests, the agent’s feasible set differs from equation (22). Those issues introduce new strategic and informational constraints. The model abstracts from them so that the role of a genuine execution constraint can be examined clearly.
The term safe harbor is used for a hypothetical reduction in expected sanctions conditional on the certified mode. It is not a claim that a government already offers this arrangement for autonomous tax agents. All monetary liability remains with the firm. No system is fined in its own right, no legal personhood is required, and no change in a jurisdiction’s statutory responsibility is asserted. Because the object is a theoretical reporting rule, the policy discussion is not legal advice.
The zero-cap result is particularly restrictive. Reduced penalties cannot compensate lost services when no violation occurs and no sanction is payable. If an actual safe harbor instead reduces a fixed audit burden, litigation expense or uncertainty over lawful reporting, its compliance-path value could be positive. Such a benefit is absent from our instrument s. Adding it would modify the participation inequality, and should be described as a different instrument rather than a verbal reinterpretation of the same formula.
The crowding-out result also suggests that a regulator should not assess certification while holding mandates fixed. A gate can save private correction expenditure and thereby induce a higher executed action than the unrestricted equilibrium. This is compatible with the gate being effective in the mechanical sense of lowering the default action. Whether the change improves welfare depends on saved resources, remaining concealment harms and lawful-service losses. The paper supplies those accounting components but does not presume a sign for their sum.

11.3. First Best, Revenue and Welfare

Our aggregate utility benchmark counts an owner’s nonpecuniary compliance preference and adds public harms of concealment. It does not model public expenditure production, redistribution across heterogeneous households or the marginal cost of public funds. Accordingly, the treasury objective and resource objective are distinct. If a planner assigns an additional shadow value to revenue, that value must enter explicitly. Treating unpaid tax as destroyed resources while also adding government collections would double count transfers and can reverse policy rankings.
Nor do we claim that accurate reporting is globally optimal for every technology in the absence of a costless compliance instrument. A planner might balance expensive controls against residual reporting distortions. Our terminology distinguishes the legally compliant target x = 0 , the owner’s preferred target, and the welfare-maximizing allocation within a stated policy class. A compliance threshold is not a proof that its enforcement cost is justified. A within-branch cap optimum is not a proof of a globally optimal safe harbor.
Endogenous deployment creates additional selection effects. Firms with greater lawful service benefits can adopt earlier, but a certification restriction may exclude precisely those benefiting from flexible automation. Since θ only scales the lawful benefit in our heterogeneity example, it is observed neither through tax complexity nor firm size. Describing the resulting threshold as a prediction that large firms adopt first would exceed the model. A richer specification could relate scale to the fixed correction investment and repeated execution volume, while preserving the liability-score distinction.

11.4. Limits of the Formal Claims

The model is deterministic, static and risk neutral. Audits reveal the concealed base perfectly when they occur; government-side classification errors and human inspection allocation are excluded. The owner knows all parameters and can choose a continuous verified mandate without uncertainty. The tax base is fixed, sanctions are collected, certification is enforceable, and upper-base constraints remain nonbinding. These restrictions enable exact proofs but limit generality.
The one-sided objective omission assumption is especially consequential. It rules out defaults that are too conservative and produces a monotone improvement in compliance when correction becomes cheaper. The signed-bias illustration expands the logical possibilities without presenting a solved general adoption model. The capability turning point, meanwhile, depends on how the cost of a verified coefficient change scales with the action technology. Curvature checks expose some sensitivity but cannot establish robustness to all alternative implementation technologies.
The shared-mandate extension places correction resources on a batch deployment and identifies the highest-default tail as a compliance bottleneck. A further dynamic extension could permit learning, adaptive tax strategies and aggregate government observations. Such a setting could connect scale, option-set expansion and compliance gates beyond the static result. Another extension would make certification verifiable only probabilistically and permit bypass. Both would require additional incentive constraints; neither can be obtained by renaming a parameter in the static benchmark.
Finally, source verification, symbolic checks, numerical tests and role-based internal critiques do not amount to external peer review. The theoretical statements are contingent on their assumptions. The author has confirmed the model and the bounded scientific claims in the accompanying summary; that record does not establish originality or replace responsibility for the final text. The available novelty search limits broad priority claims and identifies close precedents, but cannot prove that no unpublished or differently titled model contains the same mechanism. The contribution should be assessed on its explicit comparative statics and implementation restrictions.

12. Conclusion

Delegating a tax decision changes enforcement when liability and execution pass through different control margins. The owner in our model bears all monetary consequences, but the system selects the maximizer of a specified objective. Correcting an omitted consequence costs real resources. This creates an execution wedge without assuming that the machine has a desire to evade taxes or that the owner is unaware of its behavior.
The solved hierarchy yields several conditional conclusions. Delegation can increase concealment through both a cheaper reporting technology and incomplete objective correction. Making correction cheaper reduces concealment in the baseline, but exact owner alignment does not imply accurate reporting when the owner prefers concealment. A separate conservative-default example shows how alignment can even increase concealment outside the one-sided omission model. These statements concern different objective domains and should not be conflated.
Capability can improve the effectiveness of correction as well as expand the response to neglected incentives. A compliant owner can therefore generate a rise and subsequent fall in concealment as the execution technology improves, even with unchanged sanction pass-through. The turning point is observable in the normalized computational example but is not a universal prediction for all AI upgrades. The cost-of-correction technology and the feasible capability range determine whether the relevant region is reached.
Strict liability has a finite compliance threshold in the baseline. It need not implement accurate reporting at the human threshold or under a bounded feasible sanction. At the same time, it remains effective through the owner’s correction decision even when sanctions do not enter the default score. Achieving accurate reporting may require specification resources and can alter adoption, so action implementation should be distinguished from efficient deployment.
Executable certification supplies another control margin. It can eliminate concealment at a zero cap when voluntary participation holds, but sanction relief alone has no value on that compliant path. A positive cap can crowd out private correction and increase concealment relative to an unrestricted corrected system. Conditional cap design must therefore account for the owner’s reoptimization, lawful service losses and outside options. Its resource optimum is a within-regime result, not a general endorsement of safe harbors. Equivalent private gates or low-cost human reporting with retained lawful AI services can remove the incremental attraction of certification. The shared-mandate extension similarly conditions on deployment and shows that the highest-default contexts, rather than total routine scale, determine exact all-context compliance. Alternative correction costs and subquadratic action curvature remove some headline benchmark conclusions.
The contribution is a tractable interaction among costly objective correction, capability, monetary accountability and executable constraints. Existing tax-intermediary and AI-delegation theories establish much of the conceptual background. The present results support a narrower reporting application, with complete proofs and reproducible illustrations under the stated assumptions. The author has confirmed the model and these bounded scientific claims. They identify conditions to investigate rather than establish empirical claims about current firms, tax systems or language models.

Funding

This research received no external funding.

Data Availability Statement

No proprietary or confidential data were used. Numerical output is generated from the theoretical model and can be regenerated from the accompanying code.

Acknowledgments

The local submission package includes executable Python source, tests and a reproduction manifest. No public repository or permanent external record has been created. OpenAI Codex was used extensively for literature discovery and source organization, model and proof candidates, symbolic checking, computational implementation, counterexample searches, manuscript drafting, and independent role-based AI agent critiques. Primary-source bibliographic records were checked, numerical outputs regenerated, and proofs checked against stated assumptions. Internal AI critiques and these checks do not constitute external peer review. On October 3, 2026, the author explicitly confirmed the model, assumptions, propositions and bounded conclusions in the scientific-claim summary and takes responsibility for these scientific claims. This confirmation does not establish priority or replace the author’s responsibility for the final text. AI tools are not authors.

Conflicts of Interest

The author declares no conflicts of interest.

Appendix A. Proofs and Boundary Cases

Appendix A.1. Proof of Proposition 1

The score has second derivative − k < 0 . Its unconstrained maximizer is ( a − m ) / k , so the nonnegative response is equation (6); the maintained upper-bound restriction makes y nonbinding. If a ≤ 0 , all nonnegative mandates yield x = 0 , and m = 0 minimizes correction cost. Suppose a > 0 . For m > a , the action remains zero; such a mandate is weakly dominated by m = a . On [ 0 , a ] , substitute x = ( a − m ) / k into f ( x ) − η m 2 / 2 . Differentiating gives
d d m { f ( x ( m ) ) − C ( m ) } = g − m k − η m , d 2 d m 2 { f ( x ( m ) ) − C ( m ) } = − 1 k − η < 0 .
The unconstrained optimum is g / ( 1 + η k ) ≥ 0 . Projection onto [ 0 , a ] gives m U . If the upper projection binds, g ≥ a ( 1 + η k ) , equivalent to A + η k a ≤ 0 because A = a − g . Otherwise substitution gives equation (7). On the positive-action branch,
x U − A / k = { a ( 1 + η k ) − g − A ( 1 + η k ) } / [ k ( 1 + η k ) ] = η g / ( 1 + η k ) .
If η = 0 , mandates above a can tie when x = 0 ; our convention selects the minimum mandate. Thus the selected mandate is unique even where the set of zero-cost mandates is not. This proves the stated selected equilibrium and gap. □

Appendix A.2. Proof of Proposition 2

When A > 0 , equation (8) can be added to the difference between A / k and A / k H , establishing equation (10). Since g ≥ 0 , both terms are nonnegative for k ≤ k H . Strictness holds if either term is positive. To obtain equation (9), complete the square in f: f ( x ) = A 2 / ( 2 k ) − k ( x − A / k ) 2 / 2 . Use x U − A / k = η g / ( 1 + η k ) and m U = g / ( 1 + η k ) . The sum of action distortion and correction cost is η g 2 / [ 2 ( 1 + η k ) ] . The owner compares v H with B − F + v U , after removing the common after-tax-income constant. Rearranging proves the adoption inequality in every reporting regime. With B = θ q and q > 0 , divide the inequality by q. If its right-hand threshold is negative, every nonnegative type satisfies the weak private comparison. The weak inequality describes a private value comparison. Strict inequality selects unrestricted adoption; at equality the declared lower-action, then direct-control rule applies. For k ≤ k H , x U ≥ x H , so equality selects direct control. □

Appendix A.3. Proof of Proposition 3

On the active branch,
x U = A / k + η a 1 + η k , ∂ x U ∂ η = a − A ( 1 + η k ) 2 = g ( 1 + η k ) 2 .
The positive-part formula is continuous at entry to the active branch and is zero before entry, so weak monotonicity extends to the full domain. Taking η ↓ 0 yields A + / k . For optimized owner value, take any feasible mandate at the larger correction cost and use it at the smaller cost. Its payoff weakly increases. Taking maxima proves the value claim without differentiability at the regime boundary. Finally x P = 0 if and only if A ≤ 0 . The signed-bias example follows separately from differentiating equation (13); it is not needed for the baseline proposition. □

Appendix A.4. Proof of Proposition 4

Differentiate the rational expression for x U on the positive branch, treating a , A , η as constants. Expanding and collecting terms gives equation (14). If A ≥ 0 , its numerator is nonpositive, so x U is weakly decreasing in k. If A = − c < 0 , positivity requires − c + η k a > 0 , which gives k > k 0 . In that domain the derivative numerator is
c ( 1 + 2 η k ) − η 2 a k 2 .
This concave quadratic has one positive root, k peak in equation (15), and one negative root. It is positive below the positive root and negative above it. Since c 2 + a c > 0 , k peak > c / ( η a ) = k 0 . Reversing direction from increasing k to improving capability proves the stated rise and fall. For k ≤ k 0 , the positive part sets the action to zero. If a ≤ 0 or η = 0 , the prerequisites of this turning-point statement fail and the baseline equilibrium supplies the corresponding boundary result. The upper-base restriction may exclude either boundary, hence the explicit feasible-range qualification. □

Appendix A.5. Proof of Proposition 5

By Proposition 1, x U = 0 exactly when
τ − t − h + η k ( τ − r t ) ≤ 0 .
The coefficient of t is − ( 1 + η k r ) < 0 . Rearranging and imposing t ≥ 0 gives t A . This algebra remains valid when a ≤ 0 , because then A ≤ 0 and the numerator is nonpositive. The human threshold follows from equation (3). If τ > h , the numerator defining t A is positive; subtract τ − h to obtain equation (21). Bounded feasibility follows from the necessary and sufficient threshold condition. No step uses r > 0 , so the r = 0 case is included. Neither deployment participation nor welfare optimality follows from this action condition. □

Appendix A.6. Proof of Proposition 6

Fix the certified sanction. For b ≤ a C / k , all mandates in [ 0 , a C − k b ] implement b; the least-cost mandate in that interval is zero. For larger mandates up to a C , the owner payoff is the unrestricted strictly concave reduced objective. If its unrestricted maximizer m U C lies above a C − k b , its action x U C is below b and it is the only candidate on that strictly concave portion. If it lies at or below the kink, the maximum of that portion is at the kink and is weakly dominated by m = 0 implementing the same capped action at lower cost. Thus only the two stated options need comparison.
For b ≤ x U C , the zero-correction option is selected because the corrected optimum is infeasible below the cap. For b > x U C , compare f C ( b ) with v U C . The concave parabola f C ( b ) − v U C is nonnegative at x U C , since f C ( x U C ) = v U C + C ( m U C ) . Its upper root is ( A C + A C 2 − 2 k v U C ) / k . The discriminant is nonnegative: v U C is no larger than max x ≥ 0 f C ( x ) ; if A C < 0 , that maximum is zero, so v U C ≤ 0 . For A C ≥ 0 , it is A C 2 / ( 2 k ) . The upper root is therefore at least x U C , and comparison up to a C / k gives b sw . At equality our minimum-expenditure convention selects zero correction. For b > a C / k , the cap does not bind the default and the outcome is unrestricted.
If C ( m U C ) > 0 and x U C > 0 , continuity gives a nonempty interval above x U C on which the zero-correction option is strictly preferred. The explicitly stated condition b sw > x U C covers the relevant domain even in cost-free or boundary cases. Within that interval x C = b > x U C and b < a C / k , proving the crowding-out comparison. □

Appendix A.7. Proof of Proposition 7

At b = 0 , all executable actions have x = 0 . Any nonzero mandate is weakly dominated by m = 0 , selected by the least-mandate convention when expenditure also ties. The certified option value is B − F − K C − L 0 , independent of s, because both tax savings and expected sanctions associated with concealment are zero. The owner selects it over all uncertified modes exactly under the weak comparison with v O , with our explicit convention selecting certification at a private-value tie. For implementation regardless of owner tie-breaking, replace the weak value comparison by strict inequality. At a positive cap, the same mode comparison uses the optimized v C ( b , s ) and the agent response already established. This is participation plus obedience in the specified hierarchy. □

Appendix A.8. Proof of Proposition 8

On the selected zero-correction branch, x C = b and m C = 0 . Substitute equation (24) into the owner mode comparison. Collecting powers of b yields E + J b − Q b 2 / 2 ≥ 0 , with Q > 0 . If the discriminant is negative there is no feasible point; if it is nonnegative the inequality holds between the two stated roots. Intersection with the closed branch domain and [ 0 , b ¯ ] gives the stated interval or an empty set. The branch endpoint is included by the minimum-expenditure convention. Across-mode participation endpoints are included by the explicit implementation tie rule when the certified cap meets the mode selection comparison.
On that interval, equation (28) reduces to a strictly concave quadratic whose derivative is
2 L 0 b ¯ − ( h + d ) − k + D + 2 L 0 b ¯ 2 b .
The coefficient of b is strictly negative. Its unique unconstrained zero is the argument of the projection in equation (29). Maximization of a strictly concave quadratic over a closed interval projects that zero onto the interval. Certification priority at private-value ties selects the certified allocation at participation roots. This proves the conditional weak-implementation result. Under arbitrary tie-breaking those roots need not implement certification, and the strict-participation problem may have only a supremum. No statement of global policy optimality is made. □

Appendix A.9. A Nonattained Strict-Implementation Boundary

Take τ = . 4 , t = . 6 , r = h = 0 , k = k H = η = 1 , y = 1 , B = . 1 , F = K C = d = D = 0 , L 0 = . 07 , b ¯ = . 4 , s = 0 . The unrestricted option has x U = . 1 , m U = . 3 , v U = − . 07 , and v O = . 03 . The weak-participation cap interval is [ 0 , . 16 ] and the within-branch resource stationary point is . 186667 , so the projected weak optimum is . 16 . At that endpoint certification and unrestricted deployment have equal private values, but certified concealment is . 16 versus . 1 . A lower-action across-mode tie rule would select unrestricted deployment, making the certified welfare limit unattainable. Caps strictly below . 16 implement certification near the endpoint, and their welfare approaches the weak optimum. This counterexample explains why the certification-priority convention and the distinction between weak and strict implementation are part of Proposition 8.

Appendix A.10. Transfer Identity and Value Derivative

Owner total utility is ( 1 − τ ) y + B − F − K C − L + f ( x ) − C ( m ) . Add gross treasury receipts τ y + ( t z − τ ) x and subtract K ( t ) once. Monetary terms in x cancel, leaving equation (28) before additional public harm. Thus penalties do not enter as a second welfare loss. For the interior value derivative with respect to k, envelope differentiation at a fixed optimal mandate gives − x U 2 / 2 + ( A − k x U ) ( − x U / k ) . The owner first-order condition implies A − k x U = − η k m U , yielding equation (16). This derivative requires the interior response and is not asserted at regime switches.

Appendix A.11. Proof of the Shared-Mandate Lemma

For an active context, the derivative of its weighted contribution to V is n i ( a i + c i − m ) / k i and its second derivative is − n i / k i < 0 . At m = a i , its left derivative is n i c i / k i ≥ 0 , and its right derivative is zero. The derivative thus jumps downward, so each context contribution is concave in m. Adding − η m 2 / 2 preserves concavity. Mandates above a max never improve actions and are weakly dominated by the least all-compliant mandate a max . The left derivative there is precisely the left side of equation (18) minus η a max . Concavity makes that derivative nonnegative exactly when the endpoint is optimal. If the derivative is negative, moving slightly left improves value and leaves some highest-default context active. At equality the endpoint is selected: with η > 0 strict concavity gives uniqueness, while η = 0 and all remaining c i = 0 still yields negative quadratic reporting payoffs for any positive action. The homogeneous case follows by dividing the full objective by n. Adding only lower-default contexts adds zero to the final left derivative and cannot change the exact all-compliance condition. □

Appendix A.12. A Privately Available Costless Gate

If an owner can implement any private cap b without correction cost, gate cost or lawful-service loss, choose b = x P = A + / k . Since x P ≤ a + / k , m = 0 then executes exactly x P . Its value is the unconstrained owner maximum A + 2 / ( 2 k ) , which weakly exceeds every reporting value obtained with costly reward correction. If the owner strictly prefers accurate reporting, a private zero gate eliminates the execution wedge. Thus neither certification superiority nor a residual correction wedge survives costless private gate availability. With identical private and certified zero-gate technology and a positive certification surcharge, certified zero-gate deployment is strictly dominated, since monetary relief has no value at x = 0 . □

Appendix A.13. Alternative Control-Cost Derivative

On the active branch of equation (19), put A = − c < 0 . The derivative numerator with respect to k is c k 2 − ζ a ( 2 k + ζ ) . Since activity implies c k < ζ a , it is strictly less than ζ a k − ζ a ( 2 k + ζ ) < 0 . Thus improving capability by lowering k raises the action. The small- ϵ argument in the main text proves the subquadratic exact-compliance impossibility without a numerical limit test.

Appendix B. Computational Implementation

The implementation separates the direct benchmark, delegated equilibrium, signed-bias illustration, enforcement feasibility, certified choice and welfare accounting. The main reproduction command is python scripts/run_all.py. It writes parameter sweeps, capability series, policy regions, curvature checks, counterexamples, symbolic checks and a run manifest, and regenerates eight vector figures. Tests run with python -m pytest -q.
The quadratic implementation uses analytical mandates and then recomputes the agent response from that mandate. The independent optimization tests instead maximize the reduced owner payoff numerically over the feasible mandate interval and include endpoints. For caps, grid tests cover the flat-response segment and the correction region. The analytical cap function compares the minimum-expenditure default-cap option with the corrected unrestricted option only when its action is below the cap. This distinction is necessary at the response kink.
The wider random sweep draws parameters only inside the declared economic domain. Values are saved rather than summarized as empirical frequencies. Symbolic differentiation verifies the rational derivative identity, but the accompanying proof establishes its economic domain and branch restrictions. Curvature exercises are numerical robustness checks with specified grids; they do not replace a general theorem for arbitrary convex functions.
The package fixes dependency versions, seed and output paths. Reproduction requires no internet access once dependencies are installed, and no environment credentials. Computational mode selection rounds option values to thirteen decimal places before applying the tie convention; branch comparisons use a 10 − 14 tolerance. Exact mathematical indifference is distinct from numerical near-indifference. Bibliographic discovery scripts are separate from the reproduction command and are not needed to regenerate the theoretical illustrations. Source texts and discovery caches are research records and are excluded from the manuscript/source and computational submission archives.

References

  1. Allingham, M.G.; Sandmo, A. Income tax evasion: a theoretical analysis. J. Public Econ. 1972. [Google Scholar] [CrossRef]
  2. Yitzhaki, S. Income tax evasion: A theoretical analysis. J. Public Econ. 1974. [Google Scholar] [CrossRef]
  3. Slemrod, J. Tax Compliance and Enforcement. J. Econ. Lit. 2019. [Google Scholar] [CrossRef]
  4. Slemrod, J.; Yitzhaki, S. Tax Avoidance, Evasion, and Administration. In Handbook of Public Economics; 2002. [Google Scholar] [CrossRef]
  5. Klepper, S.; Nagin, D. The role of tax preparers in tax compliance. In Policy Sciences; 1989. [Google Scholar] [CrossRef]
  6. Klepper, S.; Mazur, M.; Nagin, D. Expert Intermediaries and Legal Compliance: The Case of Tax Preparers. J. Law Econ. 1991. [Google Scholar] [CrossRef]
  7. Battaglini, M.; Guiso, L.; Lacava, C.; Patacchini, E. Tax Professionals: Tax-Evasion Facilitators or Information Hubs? In NBER Working Paper; 2019. [Google Scholar] [CrossRef]
  8. DeBacker, J.; Heim, B.T.; Tran, A.; Yuskavage, A. Seeking Professional Help: How Paid Preparers Decrease Tax Compliance. Natl. Tax. J. 2024. [Google Scholar] [CrossRef]
  9. Alm, J.; Yan, J.; Schulze, W.D.; Vigil, M.; von Bose, C. Behavioral Factors in Tax Preparer and Tax Compliance Choices. In Kyklos; 2026. [Google Scholar] [CrossRef]
  10. Vossler, C.A.; Gilpatric, S.M. Endogenous audits, uncertainty, and taxpayer assistance services: Theory and experiments. J. Public Econ. 2018. [Google Scholar] [CrossRef]
  11. Carrillo, P.; Pomeranz, D.; Singhal, M. Dodging the Taxman: Firm Misreporting and Limits to Tax Enforcement. In American Economic Journal: Applied Economics; 2017. [Google Scholar] [CrossRef]
  12. Kleven, H.J.; Kreiner, C.T.; Saez, E. Why Can Modern Governments Tax So Much? An Agency Model of Firms as Fiscal Intermediaries. Economica 2016. [Google Scholar] [CrossRef]
  13. Desai, M.A.; Dharmapala, D. Corporate tax avoidance and high-powered incentives. J. Financ. Econ. 2006. [Google Scholar] [CrossRef]
  14. Aghion, P.; Tirole, J. Formal and Real Authority in Organizations. J. Political Econ. 1997. [Google Scholar] [CrossRef]
  15. ALONSO, R.; MATOUSCHEK, N. Optimal Delegation. Rev. Econ. Stud. 2008. [Google Scholar] [CrossRef]
  16. Holmstrom, B. Moral Hazard and Observability. Bell J. Econ. 1979. [Google Scholar] [CrossRef]
  17. Holmstrom, B.; Milgrom, P. Multitask Principal-Agent Analyses: Incentive Contracts, Asset Ownership, and Job Design. J. Law Econ. Organ. 1991. [Google Scholar] [CrossRef]
  18. Athey, S.; Bryan, K.; Gans, J. The Allocation of Decision Authority to Human and Artificial Intelligence. In NBER Working Paper; 2020. [Google Scholar] [CrossRef]
  19. Dutting, P.; Feldman, M.; Talgam-Cohen, I. Algorithmic Contract Theory: A Survey. In Foundations and Trends in Theoretical Computer Science; 2024. [Google Scholar] [CrossRef]
  20. Amodei, D.; Olah, C.; Steinhardt, J.; Christiano, P.; Schulman, J.; Mane, D. Concrete Problems in AI Safety. 2016, 1606.06565. [Google Scholar]
  21. Pan, A.; Bhatia, K.; Steinhardt, J. The Effects of Reward Misspecification: Mapping and Mitigating Misaligned Models. 2022, 2201.03544. [Google Scholar]
  22. Hadfield-Menell, D.; Dragan, A.; Abbeel, P.; Russell, S. Cooperative Inverse Reinforcement Learning. 2016, 1606.03137. [Google Scholar]
  23. Milli, S.; Hadfield-Menell, D.; Dragan, A.; Russell, S. Should Robots be Obedient? 2017, 1705.09990. [Google Scholar]
  24. Xu, R. Persuasion, Delegation, and Private Information in Algorithm-Assisted Decisions. 2024, 2402.09384. [Google Scholar]
  25. Greenwood, S.; Levy, K.; Barocas, S.; Heidari, H.; Kleinberg, J. Designing Algorithmic Delegates: The Role of Indistinguishability in Human-AI Handoff. 2025, 2506.03102. [Google Scholar]
  26. Kobis, N.; Rahwan, Z.; Rilla, R.; Supriyatno, B.I.; Bersch, C.; Ajaj, T.; Bonnefon, J.F.; Rahwan, I. Delegation to artificial intelligence can increase dishonest behaviour. Nature 2025. [Google Scholar] [CrossRef]
  27. Zhang, Y.; Xu, K.; Chen, Y. Welfare-Opaque Income: Taxation under AI-Agent Delegation, 2026. 2042. [Google Scholar]
  28. Bergemann, D.; Koh, A.; Morris, S. Mechanism Design for Alignment and Control. 2026, 2609.01595. [Google Scholar]
  29. Hadfield, G.K.; Koh, A. An Economy of AI Agents. 2025, 2509.01063. [Google Scholar]
  30. Chan, A.; Wei, K.; Huang, S.; Rajkumar, N.; Perrier, E.; Lazar, S.; Hadfield, G.K.; Anderljung, M. Infrastructure for AI Agents. 2025, 2501.10114. [Google Scholar]
  31. Guerreiro, J.; Rebelo, S.; Teles, P. Regulating Artificial Intelligence. In NBER Working Paper; 2023. [Google Scholar] [CrossRef]
  32. Huang, X.A.; Tharas, C.; Marro, S.; Truong, V.Q.; Scholkopf, B.; La Malfa, E.; Jin, Z. Mechanism Design Is Not Enough: Prosocial Agents for Cooperative AI, 2026. 2605.08426.
  33. Chandra, P.; Gujar, S.; Ghalme, G. Resourced Authority A Mechanism-Design Model for Participatory Governance of Deployed AI Agents. 2026, 2608.06353. [Google Scholar]
Figure 2. An illustrative rise and fall in concealment at constant sanction pass-through. The owner prefers accurate reporting.
Figure 2. An illustrative rise and fall in concealment at constant sanction pass-through. The owner prefers accurate reporting.
Preprints 236640 g002
Figure 3. Illustrative adoption thresholds. A negative threshold excludes unrestricted deployment at every nonnegative fixed cost.
Figure 3. Illustrative adoption thresholds. A negative threshold excludes unrestricted deployment at every nonnegative fixed cost.
Preprints 236640 g003
Figure 4. Cheaper objective correction reduces concealment in the one-sided baseline. Dashed lines show the feasible owner targets at the same technology.
Figure 4. Cheaper objective correction reduces concealment in the one-sided baseline. Dashed lines show the feasible owner targets at the same technology.
Preprints 236640 g004
Figure 5. The additional expected enforcement needed relative to direct control when h = 0 . Full monetary liability need not imply full score pass-through.
Figure 5. The additional expected enforcement needed relative to direct control when h = 0 . Full monetary liability need not imply full score pass-through.
Preprints 236640 g005
Figure 6. An executable cap can crowd out objective correction. The selected action jumps down when the owner switches to the corrected branch; the score itself is continuous.
Figure 6. An executable cap can crowd out objective correction. The selected action jumps down when the owner switches to the corrected branch; the score itself is continuous.
Preprints 236640 g006
Figure 7. Voluntary implementation restricts the policy domain. Shading denotes the feasible cap branch; the dashed vertical line denotes its resource optimum.
Figure 7. Voluntary implementation restricts the policy domain. Shading denotes the feasible cap branch; the dashed vertical line denotes its resource optimum.
Preprints 236640 g007
Figure 8. Resource welfare from a certificate offer, with private gates unavailable (left) and an identical gate privately available without a separate fee (right). The latter offer has zero effect. Human reporting with retained AI services is excluded from these panels.
Figure 8. Resource welfare from a certificate offer, with private gates unavailable (left) and an identical gate privately available without a separate fee (right). The latter offer has zero effect. Human reporting with retained AI services is excluded from these panels.
Preprints 236640 g008
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.