Recursive economics

Last updated

Recursive economics is a branch of modern economics based on a paradigm of individuals making a series of two-period optimization decisions over time.

Contents

Differences between recursive and neoclassical paradigms

The neoclassical model assumes a one-period utility maximization for a consumer and one-period profit maximization by a producer. The adjustment that occurs within that single time period is a subject of considerable debate within the field, and is often left unspecified. A time-series path in the neoclassical model is a series of these one-period utility maximizations.

In contrast, a recursive model involves two or more periods, in which the consumer or producer trades off benefits and costs across the two time periods. This trade-off is sometimes represented in what is called an Euler equation. A time-series path in the recursive model is the result of a series of these two-period decisions.

In the neoclassical model, the consumer or producer maximizes utility (or profits). In the recursive model, the subject maximizes value or welfare, which is the sum of current rewards or benefits and discounted future expected value.

The recursive model

The field is sometimes called recursive because the decisions can be represented by equations that can be transformed into a single functional equation sometimes called a Bellman equation. This equation relates the benefits or rewards that can be obtained in the current time period to the discounted value that is expected in the next period. The dynamics of recursive models can sometimes also be studied as differential equations [ citation needed ]

Pioneers in the field

The recursive paradigm originated in control theory with the invention of dynamic programming by the American mathematician Richard E. Bellman in the 1950s. Bellman described possible applications of the method in a variety of fields, including Economics, in the introduction to his 1957 book. [1] Stuart Dreyfus, David Blackwell, and Ronald A. Howard all made major contributions to the approach in the 1960s.

In addition, some scholars also cite the Kalman filter invented by Rudolf E. Kálmán and the theory of the maximum formulated by Lev Semenovich Pontryagin as forerunners of the recursive approach in economics.

Applications in economics

Some scholars point to Martin Beckmann and Richard Muth [2] as the first application of an explicit recursive equation in economics. However, probably the earliest celebrated economic application of recursive economics was Robert Merton's seminal 1973 article on the intertemporal capital asset pricing model. [3] (See also Merton's portfolio problem). Merton's theoretical model, one in which investors chose between income today and future income or capital gains, has a recursive formulation.

Nancy Stokey, Robert Lucas Jr. and Edward Prescott describe stochastic and non-stochastic dynamic programming in considerable detail, giving many examples of how to employ dynamic programming to solve problems in economic theory. [4] This book led to dynamic programming being employed to solve a wide range of theoretical problems in economics, including optimal economic growth, resource extraction, principal–agent problems, public finance, business investment, asset pricing, factor supply, and industrial organization.

The approach gained further notice in macroeconomics from the extensive exposition by Lars Ljungqvist and Thomas Sargent. [5] This book describes recursive models applied to theoretical questions in monetary policy, fiscal policy, taxation, economic growth, search theory, and labor economics.

In investment and finance, Avinash Dixit and Robert Pindyck showed the value of the method for thinking about capital budgeting, in particular showing how it was theoretically superior to the standard neoclassical investment rule. [6] Patrick Anderson adapted the method to the valuation of operating and start-up businesses [7] [8] and to the estimation of the aggregate value of privately held businesses in the US. [9]

There are serious computational issues that have hampered the adoption of recursive techniques in practice, many of which originate in the curse of dimensionality first identified by Richard Bellman.

Applied recursive methods, and discussion of the underlying theory and the difficulties, are presented in Mario Miranda & Paul Fackler (2002), [10] Meyn (2007) [11] Powell (2011) [12] and Bertsekas (2005). [13]

See also

Related Research Articles

Neoclassical economics is an approach to economics in which the production, consumption, and valuation (pricing) of goods and services are observed as driven by the supply and demand model. According to this line of thought, the value of a good or service is determined through a hypothetical maximization of utility by income-constrained individuals and of profits by firms facing production costs and employing available information and factors of production. This approach has often been justified by appealing to rational choice theory.

<span class="mw-page-title-main">Mathematical optimization</span> Study of mathematical algorithms for optimization problems

Mathematical optimization or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.

New Keynesian economics is a school of macroeconomics that strives to provide microeconomic foundations for Keynesian economics. It developed partly as a response to criticisms of Keynesian macroeconomics by adherents of new classical macroeconomics.

This aims to be a complete article list of economics topics:

<span class="mw-page-title-main">Dynamic programming</span> Problem optimization method

Dynamic programming is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics.

<span class="mw-page-title-main">Richard E. Bellman</span> American mathematician

Richard Ernest Bellman was an American applied mathematician, who introduced dynamic programming in 1953, and made important contributions in other fields of mathematics, such as biomathematics. He founded the leading biomathematical journal Mathematical Biosciences.

The Hamilton-Jacobi-Bellman (HJB) equation is a nonlinear partial differential equation that provides necessary and sufficient conditions for optimality of a control with respect to a loss function. Its solution is the value function of the optimal control problem which, once known, can be used to obtain the optimal control by taking the maximizer of the Hamiltonian involved in the HJB equation.

In mathematics, a Markov decision process (MDP) is a discrete-time stochastic control process. It provides a mathematical framework for modeling decision making in situations where outcomes are partly random and partly under the control of a decision maker. MDPs are useful for studying optimization problems solved via dynamic programming. MDPs were known at least as early as the 1950s; a core body of research on Markov decision processes resulted from Ronald Howard's 1960 book, Dynamic Programming and Markov Processes. They are used in many disciplines, including robotics, automatic control, economics and manufacturing. The name of MDPs comes from the Russian mathematician Andrey Markov as they are an extension of Markov chains.

Nancy Laura Stokey has been the Frederick Henry Prince Distinguished Service Professor of Economics at the University of Chicago since 1990 and focuses particularly on mathematical economics while recently conducting research about Growth Theory, economic dynamics, and fiscal/monetary policy. She earned her BA in economics from the University of Pennsylvania in 1972 and her PhD from Harvard University in 1978, under the direction of thesis advisor Kenneth Arrow. She is a Fellow of the Econometric Society, the American Academy of Arts and Sciences and the National Academy of Sciences. She previously served as a co editor of Econometrica and was a member of the Expert Panel of the Copenhagen Consensus. She received her Honorary Doctor of Laws (L.L.D) in 2012 from the University of Western Ontario.

<span class="mw-page-title-main">Bellman equation</span> Necessary condition for optimality associated with dynamic programming

A Bellman equation, named after Richard E. Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the "value" of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that results from those initial choices. This breaks a dynamic optimization problem into a sequence of simpler subproblems, as Bellman's “principle of optimality" prescribes. The equation applies to algebraic structures with a total ordering; for algebraic structures with a partial ordering, the generic Bellman's equation can be used.

The overlapping generations (OLG) model is one of the dominating frameworks of analysis in the study of macroeconomic dynamics and economic growth. In contrast to the Ramsey–Cass–Koopmans neoclassical growth model in which individuals are infinitely-lived, in the OLG model individuals live a finite length of time, long enough to overlap with at least one period of another agent's life.

The Ramsey–Cass–Koopmans model, or Ramsey growth model, is a neoclassical model of economic growth based primarily on the work of Frank P. Ramsey, with significant extensions by David Cass and Tjalling Koopmans. The Ramsey–Cass–Koopmans model differs from the Solow–Swan model in that the choice of consumption is explicitly microfounded at a point in time and so endogenizes the savings rate. As a result, unlike in the Solow–Swan model, the saving rate may not be constant along the transition to the long run steady state. Another implication of the model is that the outcome is Pareto optimal or Pareto efficient.

Merton's portfolio problem is a problem in continuous-time finance and in particular intertemporal portfolio choice. An investor must choose how much to consume and must allocate their wealth between stocks and a risk-free asset so as to maximize expected utility. The problem was formulated and solved by Robert C. Merton in 1969 both for finite lifetimes and for the infinite case. Research has continued to extend and generalize the model to include factors like transaction costs and bankruptcy.

The following outline is provided as an overview of and topical guide to finance:

The value function of an optimization problem gives the value attained by the objective function at a solution, while only depending on the parameters of the problem. In a controlled dynamical system, the value function represents the optimal payoff of the system over the interval [t, t1] when started at the time-t state variable x(t)=x. If the objective function represents some cost that is to be minimized, the value function can be interpreted as the cost to finish the optimal program, and is thus referred to as "cost-to-go function." In an economic context, where the objective function usually represents utility, the value function is conceptually equivalent to the indirect utility function.

Stochastic control or stochastic optimal control is a sub field of control theory that deals with the existence of uncertainty either in observations or in the noise that drives the evolution of the system. The system designer assumes, in a Bayesian probability-driven fashion, that random noise with known probability distribution affects the evolution and observation of the state variables. Stochastic control aims to design the time path of the controlled variables that performs the desired control task with minimum cost, somehow defined, despite the presence of this noise. The context may be either discrete time or continuous time.

Mathematical economics is the application of mathematical methods to represent theories and analyze problems in economics. Often, these applied methods are beyond simple geometry, and may include differential and integral calculus, difference and differential equations, matrix algebra, mathematical programming, or other computational methods. Proponents of this approach claim that it allows the formulation of theoretical relationships with rigor, generality, and simplicity.

<span class="mw-page-title-main">Dimitri Bertsekas</span>

Dimitri Panteli Bertsekas is an applied mathematician, electrical engineer, and computer scientist, a McAfee Professor at the Department of Electrical Engineering and Computer Science in School of Engineering at the Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts, and also a Fulton Professor of Computational Decision Making at Arizona State University, Tempe.

In economics, non-convexity refers to violations of the convexity assumptions of elementary economics. Basic economics textbooks concentrate on consumers with convex preferences and convex budget sets and on producers with convex production sets; for convex models, the predicted economic behavior is well understood. When convexity assumptions are violated, then many of the good properties of competitive markets need not hold: Thus, non-convexity is associated with market failures, where supply and demand differ or where market equilibria can be inefficient. Non-convex economies are studied with nonsmooth analysis, which is a generalization of convex analysis.

Intertemporal portfolio choice is the process of allocating one's investable wealth to various assets, especially financial assets, repeatedly over time, in such a way as to optimize some criterion. The set of asset proportions at any time defines a portfolio. Since the returns on almost all assets are not fully predictable, the criterion has to take financial risk into account. Typically the criterion is the expected value of some concave function of the value of the portfolio after a certain number of time periods—that is, the expected utility of final wealth. Alternatively, it may be a function of the various levels of goods and services consumption that are attained by withdrawing some funds from the portfolio after each time period.

References

  1. ↑ Dynamic Programming Princeton, 1957; reissued by Dover
  2. ↑ Martin Beckmann and Richard Muth, 1954, "On the solution to the fundamental equation of inventory theory," Cowles Commission Discussion Paper 2116.
  3. ↑ Robert C. Merton, 1973, "An Intertemporal Capital Asset Pricing Model," Econometrica 41: 867–887.
  4. ↑ Nancy Stokey, and Robert E. Lucas, with Edward Prescott, 1989. Recursive Methods in Economic Dynamics. Harvard Univ. Press.
  5. ↑ Lars Ljungqvist & Thomas Sargent, 2000, 2004, 2012. Recursive Macroeconomic Theory. MIT Press.
  6. ↑ Avinash Dixit & Robert Pindyck, 1994. Investment Under Uncertainty. Princeton Univ. Press.
  7. ↑ Anderson, Patrick L., Business Economics & Finance, CRC Press, 2004, ISBN   1-58488-348-0.
  8. ↑ Anderson, Patrick L., Economics of Business Valuation, Stanford University Press, 2013
  9. ↑ The Value of Private Businesses in the United States, Business Economics (2009) 44, 87–108. doi : 10.1057/be.2009.4.
  10. ↑ Miranda, M., & Fackler, P., 2002. Applied Computational Economics and Finance. MIT Press
  11. ↑ S. P. Meyn, 2007. Control Techniques for Complex Networks Archived 2008-05-13 at the Wayback Machine , Cambridge University Press, 2007. Meyn & Tweedie Archived 2007-10-12 at the Wayback Machine ,
  12. ↑ Warren B. Powell, Approximate Dynamic Programming, 2d ed. Wiley, 2011,
  13. ↑ Dimitri Bertsekas, Dynamic Programming and Optimal Control, Athena Scientific 2005, 2012
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.