This algorithm extends Ljungqvist and Sargent (2012) algorithm of Stackelberg dynamic game to the case of dynamic stochastic general equilibrium models including exogenous forcing variables. It is based Anderson, Hansen, McGrattan, Sargent (1996) discounted augmented linear quadratic regulator....

In this paper we outline the Lagrangian constrained optimization method to solve complex problems subject to constraints. Firstly we summarize the Lagrangian constrained optimization routine. Secondly we outline a detailed implementation strategy. Thirdly and finally we provide example and solve...

This article presents an algorithm that extends Ljungqvist and Sargent's (2012) dynamic Stackelberg game to the case of dynamic stochastic general equilibrium models including forcing variables. Its first step is the solution of the discounted augmented linear quadratic regulator as in Hansen...

We present the first necessary and sufficient conditions for there to be a unique perfect-foresight solution to an otherwise linear dynamic model with occasionally binding constraints, given a fixed terminal condition. We derive further conditions on the existence of a solution in such models....

We present the first necessary and sufficient conditions for there to be a unique perfect-foresight solution to an otherwise linear dynamic model with occasionally binding constraints, given a fixed terminal condition. We derive further conditions on the existence of a solution in such models....

We present the first necessary and sufficient conditions for there to be a unique perfect-foresight solution to an otherwise linear dynamic model with occasionally binding constraints, given a fixed terminal condition. We derive further results on the existence of a solution in the presence of...

Recent experience with interest rates hitting the effective lower bound and agents facing binding borrowing constraints has emphasised the importance of understanding the behaviour of an economy in which some variables may be restricted at times. The extended path algorithm is a commonly used...

Using a discrete version of the Ramsey Vintage Capital Model, we provide a characterization of the initial capital stocks compatible with a predefined scrapping time and a level of technical progress which generate feasible capital paths. From that characterization, it is proved that for a given...