A Simple Algorithm for Solving Ramsey Optimal Policy with Exogenous Forcing Variables
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. It adds an intermediate step in solving a Sylvester equation. Forward-looking variables are also optimally anchored on forcing variables. This simple algorithm calls for already programmed routines for Ricatti, Sylvester and Inverse matrix in Matlab and Scilab. A final step using a change of basis vector computes a vector auto regressive representation including Ramsey optimal policy rule function of lagged observable variables, when the exogenous forcing variables are not observable.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
An Inverse-Ramsey Tax Rule
Traditional optimal commodity tax analysis, dating back to Ramsey (1927), prescribes that to maximize welfare one should impose higher taxes on goods with lower demand elasticities. Yet policy makers do not stress minimi…
Ramsey Optimal Policy versus Multiple Equilibria with Fiscal and Monetary Interactions
We consider a frictionless constant endowment economy based on Leeper (1991). In this economy, it is shown that, under an ad-hoc monetary rule and an ad-hoc fiscal rule, there are two equilibria. One has active monetary …
RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching
The Ramsey number is the minimum number of nodes, $n = R(s, t)$, such that all undirected simple graphs of order $n$, contain a clique of order $s$, or an independent set of order $t$. This paper explores the application…
Reinforcement Learning (RL)Solving Graph Coloring Problems with Abstraction and Symmetry
This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further evidence that the Ramsey number $R(4,3,3…
Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
Ramsey-good graphs are graphs that contain neither a clique of size $s$ nor an independent set of size $t$. We study doubly saturated Ramsey-good graphs, defined as Ramsey-good graphs in which the addition or removal of …