Overtaking criterion

Last updated

In economics, the overtaking criterion is used to compare infinite streams of outcomes. Mathematically, it is used to properly define a notion of optimality for a problem of optimal control on an unbounded time interval. [1]

Contents

Often, the decisions of a policy-maker may have influences that extend to the far future. Economic decisions made today may influence the economic growth of a nation for an unknown number of years into the future. In such cases, it is often convenient to model the future outcomes as an infinite stream. Then, it may be required to compare two infinite streams and decide which one of them is better (for example, in order to decide on a policy). The overtaking criterion is one option to do this comparison.

Notation

is the set of possible outcomes. E.g., it may be the set of positive real numbers, representing the possible annual gross domestic product. It is normalized

is the set of infinite sequences of possible outcomes. Each element in is of the form: .

is a partial order. Given two infinite sequences , it is possible that is weakly better () or that is weakly better () or that they are incomparable.

is the strict variant of , i.e., if and not .

Cardinal definition

is called the "overtaking criterion" if there is an infinite sequence of real-valued functions such that: [2]

     iff     

An alternative condition is: [3] [4]

     iff     

Examples:

1. In the following example, :

This shows that a difference in a single time period may affect the entire sequence.

2. In the following example, and are incomparable:

The partial sums of are larger, then smaller, then equal to the partial sums of , so none of these sequences "overtakes" the other.

This also shows that the overtaking criterion cannot be represented by a single cardinal utility function. I.e, there is no real-valued function such that iff . One way to see this is: [3] for every and :

Hence, there is a set of disjoint nonempty segments in with a cardinality like the cardinality of . In contrast, every set of disjoint nonempty segments in must be a countable set.

Ordinal definition

Define as the subset of in which only the first T elements are nonzero. Each element of is of the form .

is called the "overtaking criterion" if it satisfies the following axioms:

1. For every , is a complete order on

2. For every , is a continuous relation in the obvious topology on .

3. For each , is preferentially-independent (see Debreu theorems#Additivity of ordinal utility function for a definition). Also, for every , at least three of the factors in are essential (have an effect on the preferences).

4.      iff     

Every partial order that satisfies these axioms, also satisfies the first cardinal definition. [2]

As explained above, some sequences may be incomparable by the overtaking criterion. This is why the overtaking criterion is defined as a partial ordering on , and a complete ordering only on .

Applications

The overtaking criterion is used in economic growth theory. [5]

It is also used in repeated games theory, as an alternative to the limit-of-means criterion and the discounted-sum criterion. See Folk theorem (game theory)#Overtaking. [3] [4]

See also

Related Research Articles

In mathematics, a series is, roughly speaking, the operation of adding infinitely many quantities, one after the other, to a given starting quantity. The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures through generating functions. In addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative disciplines such as physics, computer science, statistics and finance.

In mathematics, a product is the result of multiplication, or an expression that identifies objects to be multiplied, called factors. For example, 30 is the product of 6 and 5, and is the product of and .

<span class="mw-page-title-main">Sequence</span> Finite or infinite ordered list of elements

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members. The number of elements is called the length of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an arbitrary index set.

In mathematics, a topological space is called separable if it contains a countable, dense subset; that is, there exists a sequence of elements of the space such that every nonempty open subset of the space contains at least one element of the sequence.

In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series.

In mathematics, an infinite series of numbers is said to converge absolutely if the sum of the absolute values of the summands is finite. More precisely, a real or complex series is said to converge absolutely if for some real number Similarly, an improper integral of a function, is said to converge absolutely if the integral of the absolute value of the integrand is finite—that is, if

A mathematical symbol is a figure or a combination of figures that is used to represent a mathematical object, an action on mathematical objects, a relation between mathematical objects, or for structuring the other symbols that occur in a formula. As formulas are entirely constituted with symbols of various types, many symbols are needed for expressing all mathematics.

In functional analysis and related areas of mathematics, Fréchet spaces, named after Maurice Fréchet, are special topological vector spaces. They are generalizations of Banach spaces. All Banach and Hilbert spaces are Fréchet spaces. Spaces of infinitely differentiable functions are typical examples of Fréchet spaces, many of which are typically not Banach spaces.

<span class="mw-page-title-main">Maximal and minimal elements</span> Element that is not ≤ (or ≥) any other element

In mathematics, especially in order theory, a maximal element of a subset S of some preordered set is an element of S that is not smaller than any other element in S. A minimal element of a subset S of some preordered set is defined dually as an element of S that is not greater than any other element in S.

In mathematical analysis, Cesàro summation assigns values to some infinite sums that are not necessarily convergent in the usual sense. The Cesàro sum is defined as the limit, as n tends to infinity, of the sequence of arithmetic means of the first n partial sums of the series.

In mathematics, specifically order theory, a well-quasi-ordering or wqo on a set is a quasi-ordering such that any infinite sequence of elements from contains an increasing pair with

In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series. It is named after the French mathematician Augustin-Louis Cauchy.

In economics, an ordinal utility function is a function representing the preferences of an agent on an ordinal scale. Ordinal utility theory claims that it is only meaningful to ask which option is better than the other, but it is meaningless to ask how much better it is or how good it is. All of the theory of consumer decision-making under conditions of certainty can be, and typically is, expressed in terms of ordinal utility.

In functional analysis and related areas of mathematics, a sequence space is a vector space whose elements are infinite sequences of real or complex numbers. Equivalently, it is a function space whose elements are functions from the natural numbers to the field K of real or complex numbers. The set of all such functions is naturally identified with the set of all possible infinite sequences with elements in K, and can be turned into a vector space under the operations of pointwise addition of functions and pointwise scalar multiplication. All sequence spaces are linear subspaces of this space. Sequence spaces are typically equipped with a norm, or at least the structure of a topological vector space.

In mathematics, the Riemann series theorem, also called the Riemann rearrangement theorem, named after 19th-century German mathematician Bernhard Riemann, says that if an infinite series of real numbers is conditionally convergent, then its terms can be arranged in a permutation so that the new series converges to an arbitrary real number, or diverges. This implies that a series of real numbers is absolutely convergent if and only if it is unconditionally convergent.

In mathematics, majorization is a preorder on vectors of real numbers. Let denote the -th largest element of the vector . Given , we say that weakly majorizesfrom below denoted as if for all . If in addition , we say that majorizes, written as , or equivalently, we say that is majorized by . The order of the entries of the vectors or does not affect the majorization, e.g., the statement is simply equivalent to . As a consequence, majorization is not a partial order, since and do not imply , it only implies that the components of each vector are equal, but not necessarily in the same order.

In probability theory and statistics, a stochastic order quantifies the concept of one random variable being "bigger" than another. These are usually partial orders, so that one random variable may be neither stochastically greater than, less than nor equal to another random variable . Many different orders exist, which have different applications.

In economics, the Debreu's theorems are preference representation theorems -- statements about the representation of a preference ordering by a real-valued utility function. The theorems were proved by Gerard Debreu during the 1950s.

In mathematics, the field of logarithmic-exponential transseries is a non-Archimedean ordered differential field which extends comparability of asymptotic growth rates of elementary nontrigonometric functions to a much broader class of objects. Each log-exp transseries represents a formal asymptotic behavior, and it can be manipulated formally, and when it converges, corresponds to actual behavior. Transseries can also be convenient for representing functions. Through their inclusion of exponentiation and logarithms, transseries are a strong generalization of the power series at infinity and other similar asymptotic expansions.

The finite promise games are a collection of mathematical games developed by American mathematician Harvey Friedman in 2009 which are used to develop a family of fast-growing functions , and . The greedy clique sequence is a graph theory concept, also developed by Friedman in 2010, which are used to develop fast-growing functions , and .

References

  1. Carlson, D. A.; Haurie, A. B.; Leizarowitz, A. (1991). "Definition of Optimality on an Unbounded Time Interval". Infinite Horizon Optimal Control. Berlin: Springer. pp. 9–17. ISBN   3-540-54249-3.
  2. 1 2 Brock, William A. (1970). "An Axiomatic Basis for the Ramsey–Weizsäcker Overtaking Criterion". Econometrica. 38 (6): 927–929. doi:10.2307/1909701. JSTOR   1909701.
  3. 1 2 3 Rubinstein, Ariel (1979). "Equilibrium in supergames with the overtaking criterion". Journal of Economic Theory. 21: 1–9. doi:10.1016/0022-0531(79)90002-4.
  4. 1 2 Rubinstein, A. (1980). "Strong perfect equilibrium in supergames". International Journal of Game Theory. 9: 1–12. doi:10.1007/BF01784792.
  5. See papers by: Gale, Koopmans, McKenzie, von Weizsacker, and Brock