We embed learning (without experimentation) in optimal growth. We extend the Mirman-Zilcha results of stochastic optimal growth to the learning case. We use recursive methods to study the effect of learning on the dynamic program by considering the case of iso-elastic utility and linear...

Using lattice programming and order theoretic fixpoint theory, we develop a powerful class of monotone iterative methods that provide a qualitative theory of Markovian equilibrium for a large class of infinite horizon economies with capital. The class of economies is large and includes...

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.

In this note, we show that the least fixed point of the Bellman operator in a certain set can be computed by value iteration whether or not the fixed point is the value function. As an application, we show one of the main results of Kamihigashi (2014, "Elementary results on solutions to the...