In this paper we introduce a technique for perfect simulation from the stationary distribution of a standard model of industry dynamics. The method can be adapted to other, possibly non-monotone, regenerative processes found in industrial organization and other fields of economics. The algorithm...

In this paper, we give Necessary and Sufficient Conditions for a Solution of the Belman Equation to be the Value Function. This result is a general principle. It requires no structure beyond the common framework of discrete-time stationary optimization problems with time-additive returns. In...

In recent years, a range of measures of "partial" or "degree of" stochastic dominance have been introduced. These measures attempt to determine the extent to which one distribution is dominated by another. In order to systematically assess these proposed measures and their relationship to...

In this paper we introduce a technique for perfect simulation from the stationary distribution of a standard model of industry dynamics. The method can be adapted to other, possibly non-monotone, regenerative processes found in industrial organization and other fields of economics. The algorithm...

In estimation and calibration studies the convergence of time series sample averages plays a central role. At the same time, a significant number of economic models do not satisfy the classical ergodicity conditions. Motivated by existing work on asymptotics of stochastic economic models, we...

This paper studies wealth distribution dynamics in a small open economy with a continuum of consumers indexed by initial wealth. Each of them solves a discrete-choice problem whose optimal policy function exhibits ergodic chaos. We show that for any initial distribu- tion of wealth given by a...

We establish some elementary results on solutions to the Bellman equation without introducing any topological assumption. Under a small number of conditions, we show that the Bellman equation has a unique solution in a certain set, that this solution is the value function, and that the value...

In this note, we show that the least xed point of the Bellman op- erator in a certain set can be computed by value iteration whether or not the xed point is the value function. As an application, we show one of the main results of Kamihigashi (2014a) with a simpler proof.