Pith. sign in

REVIEW 2 cited by

Optimal consumption and portfolio selection with Epstein-Zin utility under general constraints

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.09032 v3 pith:UBZS4JBB submitted 2021-11-17 q-fin.MF

Optimal consumption and portfolio selection with Epstein-Zin utility under general constraints

classification q-fin.MF
keywords optimalstrategiesbsdeconstraintsconsumptionepstein-zinmarketstochastic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The paper investigates the consumption-investment problem for an investor with Epstein-Zin utility in an incomplete market. Closed, not necessarily convex, constraints are imposed on strategies. The optimal consumption and investment strategies are characterized via a quadratic backward stochastic differential equation (BSDE). Due to the stochastic market environment, the solution to this BSDE is unbounded and thereby the BMO argument breaks down. After establishing the martingale optimality criterion, by delicately selecting Lyapunov functions, the verification theorem is ultimately obtained. Besides, several examples and numerical simulations for the optimal strategies are provided and illustrated.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Deep Learning for Dynamic Programming with Recursive Utility

    q-fin.CP 2026-07 conditional novelty 6.5

    CEL jointly learns value, policy, and certainty-equivalent networks for recursive-utility dynamic programming and reports out-of-sample Bellman/Euler residuals of about 1e-4–1e-3 on closed-form, VFI, DSGE, and portfol...

  2. Deep Learning for Dynamic Programming with Recursive Utility Using First-order Conditions

    q-fin.CP 2026-07 conditional novelty 6.0

    CEFOL solves recursive-utility dynamic programs by learning a state-control certainty equivalent and minimizing Bellman plus first-order/KKT residuals with neural networks.