REVIEW 1 major objections 1 minor 21 references
Finite difference methods for a continuous-time heterogeneous agent model with recursive utility
T0 review · 1 major / 1 minor · reviewed 2026-06-26 · grok-4.3
Pith's one-line read Finite difference discretizations of Epstein-Zin HJB equations admit convergent iterative solvers.
desk verdict The paper gives concrete iterative algorithms plus convergence proofs for discretized Epstein-Zin HJB equations in heterogeneous-agent models, split by late and early resolution. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
Howard-Newton and Howard-Tarski-Kantorovich iterative algorithms applied to monotone, consistent finite-difference discretizations of the HJB equation.
What would settle it
A discretized Epstein-Zin HJB equation satisfying monotonicity and consistency on which either the Howard-Newton or Howard-Tarski-Kantorovich iteration fails to converge to a solution.
Extended reading notes
Core claim
We propose, analyze and test computational methods for solving a continuous-time heterogenous agent model with Epstein-Zin utility. Having discretized the Hamilton-Jacobi-Bellman (HJB) equation arising in the model, we propose a Howard-Newton algorithm for the late resolution preference case, and a Howard-Tarski-Kantorovich algorithm for the early resolution preference case. We prove the convergence of the iterative algorithms. We obtain as a consequence the existence of solutions to the discretized HJB equations. In the late resolution case, we supply a priori estimates between the unique solutions of the continuous and discretized HJB equations.
Load-bearing premise
The continuous-time model admits a well-posed HJB equation whose finite-difference discretization preserves the monotonicity and consistency properties required for the Howard-Newton and Howard-Tarski-Kantorovich convergence arguments to apply.
Editorial extensions
If this is right
- Solutions exist for the discretized HJB equations in both resolution cases.
- In the late-resolution case the discrete solutions approximate the continuous solutions within explicit a priori bounds.
- The two algorithms apply separately according to whether uncertainty is resolved late or early.
- The methods rest on preservation of monotonicity and consistency under discretization.
Reading between the lines
- The same monotonicity-driven convergence arguments may extend to other recursive or non-expected utility specifications.
- Stable numerical solution becomes feasible for versions of the model with richer state spaces or additional agent heterogeneity.
- Quantitative work can now examine how separating risk aversion from intertemporal substitution alters aggregate dynamics and welfare in heterogeneous populations.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes, analyzes, and tests finite-difference discretizations of the Hamilton-Jacobi-Bellman equation for a continuous-time heterogeneous-agent model with Epstein-Zin recursive utility. It introduces a Howard-Newton algorithm for the late-resolution case and a Howard-Tarski-Kantorovich algorithm for the early-resolution case, proves convergence of these iterative methods, deduces existence of solutions to the discretized HJB equations as a consequence, and supplies a priori estimates between the continuous and discrete solutions in the late-resolution case.
Significance. If the convergence arguments hold, the work supplies a rigorous numerical framework for solving models that disentangle risk aversion from intertemporal substitution, a feature central to modern macro-finance. The a priori estimates between continuous and discrete solutions constitute a concrete strength, as they directly quantify discretization error rather than relying solely on numerical tests.
major comments (1)
- [discretization and algorithm analysis sections] The central convergence claims rest on the discrete operator inheriting monotonicity and consistency from the continuous Epstein-Zin HJB. The abstract asserts that the Howard-Newton and Howard-Tarski-Kantorovich theorems apply, yet the verification that the chosen finite-difference scheme preserves these properties for the nonlinear recursive Hamiltonian (distinct early- versus late-resolution structures) is not supplied in the discretization or algorithm sections. This step is load-bearing; without it the cited theorems do not directly yield the stated convergence and existence results.
minor comments (1)
- Notation for the value function and its derivatives is introduced without a consolidated table; a single reference table would improve readability across the continuous and discrete formulations.
Simulated Author's Rebuttal
We thank the referee for the careful review and for identifying this load-bearing step in the convergence argument. We address the comment point-by-point below and will strengthen the manuscript accordingly.
read point-by-point responses
-
Referee: The central convergence claims rest on the discrete operator inheriting monotonicity and consistency from the continuous Epstein-Zin HJB. The abstract asserts that the Howard-Newton and Howard-Tarski-Kantorovich theorems apply, yet the verification that the chosen finite-difference scheme preserves these properties for the nonlinear recursive Hamiltonian (distinct early- versus late-resolution structures) is not supplied in the discretization or algorithm sections. This step is load-bearing; without it the cited theorems do not directly yield the stated convergence and existence results.
Authors: We agree that an explicit, self-contained verification that the finite-difference scheme preserves monotonicity and consistency for the nonlinear recursive Hamiltonian is required for both the early- and late-resolution cases. The current manuscript states that the discrete operator inherits these properties but does not supply the detailed case-by-case check against the specific form of the Epstein-Zin Hamiltonian. In the revised version we will insert a new subsection (immediately following the discretization description) that (i) recalls the precise monotonicity and consistency conditions needed by the Howard-Newton and Howard-Tarski-Kantorovich theorems, (ii) verifies them for the chosen upwind/centered differences applied to the recursive utility terms, and (iii) highlights the structural differences between the early- and late-resolution Hamiltonians that affect the verification. This addition will make the application of the cited theorems fully rigorous. revision: yes
Circularity Check
No circularity: standard numerical analysis with explicit convergence proofs for discretized HJB
full rationale
The paper's chain consists of discretizing the HJB for the Epstein-Zin model, proposing Howard-Newton and Howard-Tarski-Kantorovich iterations, proving their convergence under monotonicity/consistency of the scheme, and deducing existence plus a priori estimates. These steps rely on verifying the discrete operator properties for the nonlinear recursive case and applying external convergence theorems; no step reduces by construction to a fitted parameter, self-defined quantity, or self-citation chain. The derivation is self-contained as a numerical analysis contribution with independent verification of the required properties.
Assumptions & free parameters
Cite this review
Pith. "Pith review of Finite difference methods for a continuous-time heterogeneous agent model with recursive utility." pith.science (2026). https://pith.science/paper/W3CSUSWE
@misc{pith2026260623408,
author = {Pith},
title = {Pith review of: Finite difference methods for a continuous-time heterogeneous agent model with recursive utility},
year = {2026},
howpublished = {\url{https://pith.science/paper/W3CSUSWE}},
note = {Machine review of arXiv:2606.23408}
}
read the original abstract
We propose, analyze and test computational methods for solving a continuous-time heterogenous agent model with Epstein-Zin utility. Such recursive utilities allow the model to disentangle between risk aversion and intertemporal substitution. Having discretized the Hamilton-Jacobi-Bellman (HJB) equation arising in the model, we propose a Howard-Newton algorithm for the late resolution preference case, and a Howard-Tarski-Kantorovich algorithm for the early resolution preference case. We prove the convergence of the iterative algorithms. We obtain as a consequence the existence of solutions to the discretized HJB equations. In the late resolution case, we supply a priori estimates between the unique solutions of the continuous and discretized HJB equations.
Figures
Figures from the paper (3 more)
Reference graph
Works this paper leans on
-
[1]
Achdou and I
Y. Achdou and I. Capuzzo-Dolcetta , M ean field games: Numerical methods , SIAM Journal on Numerical Analysis, 48 (2010), pp. 1136--1162
2010
-
[2]
Achdou, P
Y. Achdou, P. Cardaliaguet, F. Delarue, A. Porretta, and F. Santambrogio , Mean field games: C etraro, I taly 2019 , vol. 2281, Springer Nature, 2021
2019
-
[3]
Achdou, J
Y. Achdou, J. Han, J.-M. Lasry, P.-L. Lions, and B. Moll , Income and wealth distribution in macroeconomics: A continuous-time approach , The Review of Economic Studies, 89 (2022), pp. 45--86
2022
-
[4]
Continuous-Time Heterogeneous Agent Models with Recursive Utility and Preference for Late Resolution
Y. Achdou and Q. Tang , Continuous-time heterogeneous agent models with recursive utility and preference for late resolution , arxiv 2603.07782, 2603.07782 (2026)
work page Pith review arXiv 2026
-
[5]
S. Ahn, G. Kaplan, B. Moll, T. Winberry, and C. Wolf , When inequality matters for macro and macro matters for inequality , NBER macroeconomics annual, 32 (2018), pp. 1--75
2018
-
[6]
Bilal , Solving heterogeneous agent models with the master equation , tech
A. Bilal , Solving heterogeneous agent models with the master equation , tech. rep., National Bureau of Economic Research, 2023
2023
-
[7]
Bloise, C
G. Bloise, C. Le Van, and Y. Vailakis , Do not blame B ellman: It is K oopmans' fault , Econometrica, 92 (2024), pp. 111--140
2024
-
[8]
Camilli, M
F. Camilli, M. Lauri \`e re, and Q. Tang , Learning equilibria in C ournot mean field games of controls , SIAM Journal on Control and Optimization, 63 (2025), pp. 1407--1431
2025
Show all 21 references
-
[9]
Camilli, Q
F. Camilli, Q. Tang, and Y.-S. Zhou , A semi- L agrangian method for solving state constraint mean field games in macroeconomics , SIAM Journal on Control and Optimization, accepted in press, preprint arXiv2510.00768 (2026)
2026
-
[10]
L. G. Epstein and S. E. Zin , Substitution, risk aversion, and the temporal behavior of consumption and asset returns: A theoretical framework , Econometrica, 57 (1989), pp. 937--969
1989
-
[11]
Fern \'a ndez-Villaverde, S
J. Fern \'a ndez-Villaverde, S. Hurtado, and G. Nuno , Financial frictions and the wealth distribution , Econometrica, 91 (2023), pp. 869--901
2023
-
[12]
Z. Gu, M. Lauri \`e re, S. Merkel, and J. Payne , Global solutions to master equations for continuous time heterogeneous agent macroeconomic models , accepted by Journal of Political Economy: Macroeconomics, arXiv:2406.13726, (2024)
2024
-
[13]
Kantorovitch , The method of successive approximation for functional equations , Acta Mathematica, 71 (1939), pp
L. Kantorovitch , The method of successive approximation for functional equations , Acta Mathematica, 71 (1939), pp. 63--97
1939
-
[14]
Kaplan, B
G. Kaplan, B. Moll, and G. L. Violante , Monetary policy according to HANK , American Economic Review, 108 (2018), pp. 697--743
2018
-
[15]
Lasry and P.-L
J.-M. Lasry and P.-L. Lions , Mean field games , Japanese Journal of Mathematics, 2 (2007), pp. 229--260
2007
-
[16]
Lauri \`e re, J
M. Lauri \`e re, J. Song, and Q. Tang , Policy iteration method for time-dependent mean field games systems with non-separable H amiltonians , Applied Mathematics & Optimization, 87 (2023), p. 17
2023
-
[17]
Ljungqvist and T
L. Ljungqvist and T. J. Sargent , Recursive macroeconomic theory , MIT press, 2018
2018
-
[18]
T. J. Sargent and J. Stachurski , Dynamic programming: finite states , Cambridge University Press, 2025
2025
-
[19]
T. J. Sargent and J. Stachurski , Dynamic programs on partially ordered sets , SIAM Journal on Control and Optimization, 63 (2025), pp. 778--795
2025
-
[20]
Tang and J
Q. Tang and J. Song , Learning optimal policies in potential mean field games: smoothed policy iteration algorithms , SIAM Journal on Control and Optimization, 62 (2024), pp. 351--375
2024
-
[21]
C. Wang, N. Wang, and J. Yang , Optimal consumption and savings with stochastic income and recursive utility , Journal of Economic Theory, 165 (2016), pp. 292--331
2016
Reviewed June 26, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.