Abstract recursive utility
As in dynamic programming or in the economic theory of nonpaternalistic intergenerational altruism, a consistent sequence of utility functions \({_ 1U}\) can always be decomposed into a recursive sequence of aggregators. The difficulty lies in the fact that two distinct \({_ 1 U}\)'s can share the same decomposition. In such a case, the decomposition cannot be regarded as equivalent to either of the two utility functions. In contrast, an equivalent decomposition decomposes exactly one \({_ 1 U}\) (i.e., has exactly one recomposition). This paper completely characterizes those \({_ 1 U}\) that have equivalent decompositions. This characterization requires no topological or algebraic structure, and can accomodate vector - and even function- valued utility functions. Given that the utility functions assume values in an antisymmetrically ordered space, the above characterization is related to the ordinal concept of tail insensitivity and to the topological concept of discrete-product continuity. Finally, the papers' results are applied to economic models of stochastic dynamic optimization and intergenerational altruism toward many descendants.
- Singular recursive utility
- scientific article; zbMATH DE number 1390021
- Primitive recursion in the abstract
- Recursive utility with unbounded aggregators
- scientific article; zbMATH DE number 221615
- Full abstraction and recursion
- Abstract recursion and intrinsic complexity
- scientific article; zbMATH DE number 3966062
- Recursive functionals
- On the role of generating functions when preferences are recursive
- A general theory of separability for preferences defined on a countably infinite product space
- Recursive utility with unbounded aggregators
- Koopmans' constant discounting for intertemporal choice: A simplification and a generalization
- Remarks on a linearization of Koopmans recursion
- On a linearization of the recursion \(U(x_0,x_1,x_2,\ldots )=\varphi (x_0, U(x_1,x_2,\ldots ))\) and its application in economics
This page was built for publication: Abstract recursive utility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367775)
