Gianmarco Corradini

The Computational Cost of Asset Measurement: Historical Cost versus Fair Value Accounting

Gianmarco Corradini

1. Introduction

The accounting treatment of an asset does not end when the asset is initially recognized. Once an asset enters the balance sheet, the accounting system must continuously determine the amount at which it should remain recognized. Different measurement bases therefore imply different information-processing requirements.

Consider two simplified accounting systems. Under the first, an asset is initially recognized at historical cost, depreciated every month and subjected to an impairment test at year-end. Under the second, the same asset is initially recognized at historical cost but subsequently remeasured to fair value every month.

The purpose of this article is not to determine which measurement basis produces superior financial information. Instead, it asks:

Research question.
How does accounting measurement complexity scale with portfolio size, valuation observability, asset heterogeneity and automation?

The comparison can therefore be formulated as a problem of accounting computational complexity and, more broadly, as a problem in the economics of information production.

2. Defining an Accounting Computation

Let an accounting computation be any distinct operation required to update or verify the carrying amount of an asset. Examples include calculating depreciation, retrieving a market price, estimating fair value, calculating an impairment amount, updating carrying values, documenting assumptions and recording the resulting adjustment.

As an initial benchmark, assume that all computations have identical cost. One depreciation calculation therefore counts as one computation, just as one fair-value reassessment counts as one computation.

3. Historical-Cost Model

Suppose an asset has acquisition cost \(C\), residual value \(R\), and useful life \(L\) months. Under straight-line depreciation:

\[D=\frac{C-R}{L}\]

The carrying amount after \(t\) months is:

\[BV_t=C-tD\]

For a full year, twelve monthly depreciation calculations are required. At year-end, let \(RA\) denote the recoverable amount. The impairment loss is:

\[I=\max(0,BV_{12}-RA)\]

If one annual impairment test is added to twelve depreciation events, one asset generates thirteen measurement computations:

\[C_{HC}(N)=13N\]

4. Monthly Fair-Value Model

Under monthly fair-value measurement, let \(FV_t\) denote the fair value of the asset at month \(t\), and let \(BV_{t-1}\) denote the carrying amount immediately before remeasurement. The required adjustment is:

\[A_t=FV_t-BV_{t-1}\]

After remeasurement:

\[BV_t=FV_t\]

Twelve monthly remeasurements therefore generate:

\[C_{FV}(N)=12N\]

Purely in terms of the number of measurement events, historical cost appears slightly more computationally intensive. This demonstrates the limitation of counting accounting operations without considering their difficulty.

5. From Computational Count to Computational Burden

A straight-line depreciation calculation and a fair-value reassessment are not economically equivalent units of work. The model therefore introduces a complexity weight for each operation.

\[c_j=f(T_j,J_j,D_j,V_j,C_j,A_j)\]

A simple linear specification is:

\[c_j=\alpha T_j+\beta J_j+\gamma D_j+\delta V_j+\theta C_j-\lambda A_j\]

6. Weighted Complexity

To illustrate the framework, assign the following normalized complexity scores. These are calibration assumptions rather than empirical estimates.

Accounting operationIllustrative complexity score
Straight-line depreciation1
Annual impairment test8
Level 1 fair value2
Level 2 fair value5
Level 3 fair value12

Historical-cost complexity becomes:

\[B_{HC}=12(1)+8=20\]

while monthly fair-value complexity becomes:

\[B_{FV1}=12(2)=24\]\[B_{FV2}=12(5)=60\]\[B_{FV3}=12(12)=144\]

The corresponding relative burdens are:

\[\frac{B_{FV1}}{B_{HC}}=1.2,\qquad \frac{B_{FV2}}{B_{HC}}=3,\qquad \frac{B_{FV3}}{B_{HC}}=7.2\]

7. Scaling with the Number of Assets

Under the simplest independence assumption:

\[B_{HC}(N)=20N\]\[B_{FV1}(N)=24N,\qquad B_{FV2}(N)=60N,\qquad B_{FV3}(N)=144N\]

The relative difference is constant, but the absolute organizational burden grows with \(N\). If the marginal difference between two measurement regimes is \(d\), then:

\[\Delta B(N)=dN\]

8. Human Effort versus Machine Computation

Not every accounting computation requires the same proportion of human intervention. Straight-line depreciation can generally be highly automated once cost, residual value and useful life have been entered into the accounting system.

Fair-value measurement may instead require market-data retrieval, model selection, investigation of price movements, validation of inputs, documentation, approval and accounting controls.

\[B=B_M+B_H\]

where \(B_M\) denotes machine-processing burden and \(B_H\) denotes human-processing burden. The relevant organizational variable is therefore not simply the number of calculations performed by the accounting software, but the amount of scarce professional capacity consumed by the measurement architecture.

9. A General Accounting Complexity Model

For operation \(j\), let \(f_j\) denote annual frequency. Then:

\[B=\sum_{j=1}^{m}f_jc_j\]

For historical cost:

\[B_{HC}=f_Dc_D+f_Ic_I\]

For fair value:

\[B_{FV}=f_Fc_F\]

Fair value becomes operationally more demanding whenever:

\[f_Fc_F>f_Dc_D+f_Ic_I\]

10. Fair Value Is Not a Single Computational Category

Fair-value measurement should be divided according to the observability and complexity of the valuation process. Define:

\[c_{F1}<c_{F2}<c_{F3}\]

A directly observable quoted price can potentially be imported and processed almost entirely automatically. A model-based valuation with unobservable inputs may instead require forecasts, calibration, sensitivity analysis and extensive professional judgment.

Key implication.
Fair value itself is not necessarily expensive. Fair-value complexity rises as market observability falls and judgment intensity rises.

11. Nonlinear Complexity and Scale

A purely linear model assumes constant marginal complexity:

\[B(N)=cN\]

Real accounting systems also contain fixed infrastructure costs and may generate additional coordination and control requirements as portfolios become larger. A more general specification is:

\[\boxed{B(N)=F+aN+bN^\alpha}\]

If \(0<\alpha<1\), the system exhibits economies of scale. If \(\alpha=1\), complexity grows linearly. If \(\alpha>1\), the system exhibits diseconomies of scale.

12. Asset Heterogeneity and Market Observability

Portfolio size alone is insufficient. Two portfolios can contain the same number of assets while requiring radically different valuation work. Introduce a heterogeneity parameter \(H\in[0,1]\) and a market-observability parameter \(O\in[0,1]\). A fair-value complexity function may then be written as:

\[B_{FV}(N,H,O)=F_{FV}+a_{FV}N+bH(1-O)N^\alpha\]

Hence:

\[\frac{\partial B}{\partial H}>0\qquad\text{and}\qquad\frac{\partial B_{FV}}{\partial O}<0\]

13. Automation

Let \(A\in[0,1]\) measure the degree of automation. A simple representation is:

\[B(N,H,O,A)=F+aN(1-A)+bH(1-O)N^\alpha(1-A)\]

A more realistic formulation separates automatable processing from judgment-intensive work:

\[B=F+aN(1-A)+jHN^\alpha\]

Automation principle.
Automation reduces mechanical accounting complexity more effectively than judgment complexity.

14. Accounting Measurement Complexity Index

The preceding variables can be combined into an Accounting Measurement Complexity Index (AMCI):

\[AMCI_i=f_i\left[w_TT_i+w_JJ_i+w_DD_i+w_VV_i+w_CC_i\right](1-\rho A_i)\]

Portfolio complexity becomes:

\[\boxed{AMCI_P=\sum_{i=1}^{N}AMCI_i+C_P}\]

where \(C_P\) captures portfolio-level infrastructure, interaction, coordination and control costs.

15. Marginal Accounting Complexity

Given \(B(N)=F+aN+bN^\alpha\), marginal complexity is:

\[\boxed{MC_B(N)=a+\alpha bN^{\alpha-1}}\]

If \(\alpha>1\), marginal accounting complexity rises with portfolio size. Each additional asset then becomes progressively more expensive to maintain from an accounting perspective.

16. Break-Even Portfolio Size

Suppose \(B_{HC}(N)=F_{HC}+a_{HC}N\) and \(B_{FV}(N)=F_{FV}+a_{FV}N\). The break-even portfolio size satisfies:

\[F_{HC}+a_{HC}N^*=F_{FV}+a_{FV}N^*\]

and therefore:

\[\boxed{N^*=\frac{F_{HC}-F_{FV}}{a_{FV}-a_{HC}}}\]

17. Numerical Simulation

The following simulation uses illustrative rather than empirically estimated coefficients:

\[B_{HC}(N)=1,000+15N\]\[B_{FV1}(N)=5,000+5N\]\[B_{FV2}(N)=5,000+25N+0.01N^{1.1}\]\[B_{FV3}(N)=5,000+60N+0.05N^{1.2}\]

AssetsHistorical CostFV Level 1FV Level 2FV Level 3
11,0155,0055,0255,060
101,1505,0505,2505,601
1002,5005,5007,50211,013
4007,0007,00015,00729,066
1,00016,00010,00030,02065,199
10,000151,00055,000255,251608,155
100,0001,501,000505,0002,508,1626,055,000

Figure 1. Accounting complexity by portfolio size

Illustrative annual complexity-adjusted workload. The horizontal axis uses a logarithmic scale so that both small and large portfolios remain visible.

Level 1 fair value starts with a higher fixed cost but has a lower marginal processing cost. Historical cost and Level 1 intersect at:

\[1,000+15N=5,000+5N\]\[\boxed{N^*=400}\]

Figure 2. Historical cost versus automated Level 1 fair value

The Level 1 system recovers its higher initial infrastructure cost at 400 assets under the illustrative calibration.
Fair-value paradox.
A current-value system can become operationally cheaper than historical cost when valuation is sufficiently observable, homogeneous and automated.

Figure 4. Average accounting complexity per asset

Average accounting complexity per asset by portfolio size
Average annual complexity per asset under the four simulated measurement technologies. The declining curves reflect the spreading of fixed costs across larger portfolios. Automated Level 1 fair value converges toward a substantially lower marginal burden than historical cost, while Level 2 and Level 3 retain higher asset-specific complexity.

18. Converting Complexity into Human-Equivalent FTE

For interpretative purposes, assume one complexity unit corresponds to one minute of human-equivalent accounting work and one full-time professional supplies approximately 1,700 productive hours per year. Then:

\[H(N)=\frac{B(N)}{60}\]

\[FTE(N)=\frac{B(N)}{60\times1,700}=\frac{B(N)}{102,000}\]

At 100,000 assets, the simulation implies approximately:

\[FTE_{HC}=14.7,\qquad FTE_{FV1}=5.0,\qquad FTE_{FV2}=24.6,\qquad FTE_{FV3}=59.4\]

Figure 3. Human-equivalent staffing at 100,000 assets

Simulated FTE requirement. The calculation is illustrative and should not be interpreted as an empirical staffing benchmark.

19. Effective Number of Valuations

The number of accounting positions is not necessarily equal to the number of distinct valuations. Suppose \(N\) assets belong to only \(G\) homogeneous valuation groups, where \(G\leq N\). A portfolio-level fair-value function can then be written as:

\[B_{FV}=F+aN+vG\]

More generally, define an Effective Number of Valuations \(N_V\):

\[N_V=g(N,H)\]

and:

\[\boxed{B_{FV}=F+aN+vN_V+bN_V^\alpha}\]

For a highly homogeneous portfolio, \(N_V\ll N\). For a completely heterogeneous portfolio, \(N_V\approx N\). This distinction may be more important empirically than the raw number of balance-sheet positions.

20. Implications and Conclusion

The computational burden of accounting measurement cannot be adequately represented by counting journal entries or arithmetic calculations. A meaningful comparison must incorporate measurement frequency, data requirements, valuation difficulty, professional judgment, documentation, controls and automation.

Historical cost concentrates complexity in initial recognition, determination of useful lives and residual values, and impairment testing. Once configured, recurring straight-line depreciation can be processed mechanically.

Fair-value accounting redistributes the burden toward recurring valuation. When observable market prices are available and can be processed automatically, fair value may exhibit substantial economies of scale. When valuation relies on unobservable inputs and professional judgment, however, the burden can become considerably larger.

The central relationship can therefore be expressed as:

\[\boxed{B=f(N,F,H,O,A,J)}\]

where \(N\) = number of assets, \(F\) = measurement frequency, \(H\) = asset heterogeneity, \(O\) = market observability, \(A\) = automation and \(J\) = professional judgment.

The simulation suggests that the relevant hierarchy is not necessarily historical cost versus fair value, but rather:

\[\boxed{\text{Automated measurement}<\text{model-based measurement}<\text{judgment-intensive measurement}}\]

The conventional accounting problem asks what value should be reported. The computational approach adds a second question: what resources are required to produce that value?

If \(I(M)\) denotes the informational benefit of measurement regime \(M\) and \(C(M)\) denotes its information-production cost, a broader economic representation is:

\[\boxed{M^*=\arg\max_M\left[I(M)-C(M)\right]}\]

Accounting measurement can consequently be interpreted as an information-production technology. Different accounting rules require different combinations of data, algorithms, professional judgment, controls and human capital to transform economic assets into reported accounting numbers.

Methodological note. The coefficients and FTE conversions used in the numerical simulation are illustrative assumptions designed to expose the properties of the model. They are not empirical estimates. A subsequent empirical study could estimate them from accounting-department working hours, valuation exceptions, manual adjustments, audit queries, market-data costs and control activities.