Optimal growth models with bounded or unbounded returns: A unifying approach (Q697975): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jeth.2001.2880 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Dynamic programming with homogeneous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Existence of Ramsey Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive utility and the Ramsey problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal growth and Pareto optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic programming with unbounded returns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stationary Recursive Utility and Dynamic Programming under the Assumption of Biconvergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract topological approach to dynamic programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JETH.2001.2880 / rank
 
Normal rank

Latest revision as of 01:02, 10 December 2024

scientific article
Language Label Description Also known as
English
Optimal growth models with bounded or unbounded returns: A unifying approach
scientific article

    Statements

    Optimal growth models with bounded or unbounded returns: A unifying approach (English)
    0 references
    0 references
    0 references
    18 September 2002
    0 references
    The authors propose a unifying approach to the study of the optimal growth models with bounded or unbounded returns. They prove the existence of optimal solutions and show, without using the contraction method, that the value function is the unique solution of the Bellman equation for a particular class of functions. The value function can be obtained by the usual algorithm defined by the operator provided by the Bellman equation.
    0 references
    optimal growth
    0 references
    value function
    0 references
    Bellman equation
    0 references

    Identifiers