Problem Set 2: Proposed solutions Econ Fall Cesar E. Tamayo Department of Economics, Rutgers University

Similar documents
ECON607 Fall 2010 University of Hawaii Professor Hui He TA: Xiaodong Sun Assignment 2

ECON 582: Dynamic Programming (Chapter 6, Acemoglu) Instructor: Dmytro Hryshko

Problem Set 3: Proposed solutions Econ Fall 2012 (Prof. Roberto Chang)

Dynamic Programming Theorems

ECON607 Fall 2010 University of Hawaii Professor Hui He TA: Xiaodong Sun Assignment 1 Suggested Solutions

Dynamic Problem Set 1 Solutions

DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION

Suggested Solutions to Problem Set 2

Macroeconomics I. University of Tokyo. Lecture 12. The Neo-Classical Growth Model: Prelude to LS Chapter 11.

Economics 210B Due: September 16, Problem Set 10. s.t. k t+1 = R(k t c t ) for all t 0, and k 0 given, lim. and

TOBB-ETU - Econ 532 Practice Problems II (Solutions)

In the Ramsey model we maximized the utility U = u[c(t)]e nt e t dt. Now

HOMEWORK #3 This homework assignment is due at NOON on Friday, November 17 in Marnix Amand s mailbox.

Competitive Equilibrium and the Welfare Theorems

Comprehensive Exam. Macro Spring 2014 Retake. August 22, 2014

Simple Consumption / Savings Problems (based on Ljungqvist & Sargent, Ch 16, 17) Jonathan Heathcote. updated, March The household s problem X

problem. max Both k (0) and h (0) are given at time 0. (a) Write down the Hamilton-Jacobi-Bellman (HJB) Equation in the dynamic programming

Suggested Solutions to Homework #3 Econ 511b (Part I), Spring 2004

UNIVERSITY OF VIENNA

ADVANCED MACROECONOMIC TECHNIQUES NOTE 3a

Neoclassical Growth Model / Cake Eating Problem

Lecture 2 The Centralized Economy

Problem Set # 2 Dynamic Part - Math Camp

The Growth Model in Continuous Time (Ramsey Model)

Macroeconomic Theory I. Cesar E. Tamayo Department of Economics, Rutgers University

EconS Microeconomic Theory II Midterm Exam #2 - Answer Key

Macroeconomic Theory and Analysis Suggested Solution for Midterm 1

1 The Basic RBC Model

Non-convex Aggregate Technology and Optimal Economic Growth

1 Objective. 2 Constrained optimization. 2.1 Utility maximization. Dieter Balkenborg Department of Economics

(a) Write down the Hamilton-Jacobi-Bellman (HJB) Equation in the dynamic programming

Endogenous Growth: AK Model

Lecture 4: The Bellman Operator Dynamic Programming

Introduction to Recursive Methods

Economics 202A Lecture Outline #3 (version 1.0)

Macroeconomics Qualifying Examination

STATE UNIVERSITY OF NEW YORK AT ALBANY Department of Economics

"A Theory of Financing Constraints and Firm Dynamics"

Macroeconomics Qualifying Examination

Slides II - Dynamic Programming

Mathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7

The Ramsey Model. Alessandra Pelloni. October TEI Lecture. Alessandra Pelloni (TEI Lecture) Economic Growth October / 61

Solutions to Problem Set 1

Monetary Economics: Solutions Problem Set 1

Dynamic Optimization Using Lagrange Multipliers

The Necessity of the Transversality Condition at Infinity: A (Very) Special Case

z = f (x; y) f (x ; y ) f (x; y) f (x; y )

Macroeconomics Theory II

FEDERAL RESERVE BANK of ATLANTA

Traditional vs. Correct Transversality Conditions, plus answers to problem set due 1/28/99

Money and the Sidrauski Model

Population growth and technological progress in the optimal growth model

Lecture 7: Linear-Quadratic Dynamic Programming Real Business Cycle Models

HOMEWORK #1 This homework assignment is due at 5PM on Friday, November 3 in Marnix Amand s mailbox.

Dynamic Macroeconomic Theory Notes. David L. Kelly. Department of Economics University of Miami Box Coral Gables, FL

Economic Growth

BEEM103 UNIVERSITY OF EXETER. BUSINESS School. January 2009 Mock Exam, Part A. OPTIMIZATION TECHNIQUES FOR ECONOMISTS solutions

Macroeconomics Qualifying Examination

EconS Microeconomic Theory I Recitation #5 - Production Theory-I 1

Dynamic Optimization: An Introduction

ADVANCED MACROECONOMICS 2015 FINAL EXAMINATION FOR THE FIRST HALF OF SPRING SEMESTER

ECON 582: The Neoclassical Growth Model (Chapter 8, Acemoglu)

Lecture 6: Discrete-Time Dynamic Optimization

Government The government faces an exogenous sequence {g t } t=0

Graduate Macroeconomics 2 Problem set Solutions

Problem Set #4 Answer Key

1. Using the model and notations covered in class, the expected returns are:

Capital Structure and Investment Dynamics with Fire Sales

1 Linear Quadratic Control Problem

Stochastic Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania

Econ 504, Lecture 1: Transversality and Stochastic Lagrange Multipliers

Dynamic Optimization Problem. April 2, Graduate School of Economics, University of Tokyo. Math Camp Day 4. Daiki Kishishita.

An adaptation of Pissarides (1990) by using random job destruction rate

Stochastic Dynamic Programming: The One Sector Growth Model

Problem 1 (30 points)

1 Bewley Economies with Aggregate Uncertainty

ECON 2010c Solution to Problem Set 1

Recursive Methods. Introduction to Dynamic Optimization

Online Appendix for Investment Hangover and the Great Recession

Advanced Economic Growth: Lecture 8, Technology Di usion, Trade and Interdependencies: Di usion of Technology

ECON0702: Mathematical Methods in Economics

1. Constant-elasticity-of-substitution (CES) or Dixit-Stiglitz aggregators. Consider the following function J: J(x) = a(j)x(j) ρ dj

Tutorial 3: Optimisation

Lecture 5: The Bellman Equation

Econ 101A Midterm 1 Th 29 September 2004.

Chapter 3. Dynamic Programming

Math Review ECON 300: Spring 2014 Benjamin A. Jones MATH/CALCULUS REVIEW

Basic Techniques. Ping Wang Department of Economics Washington University in St. Louis. January 2018

Practice Questions for Mid-Term I. Question 1: Consider the Cobb-Douglas production function in intensive form:

Economic Growth: Lecture 8, Overlapping Generations

Lecture 1: Dynamic Programming

Lecture Notes: Math Refresher 1

[A + 1 ] + (1 ) v: : (b) Show: the derivative of T at v = v 0 < 0 is: = (v 0 ) (1 ) ; [A + 1 ]

Lecture 15. Dynamic Stochastic General Equilibrium Model. Randall Romero Aguilar, PhD I Semestre 2017 Last updated: July 3, 2017

Macroeconomics IV Problem Set I

Linear and Loglinear Approximations (Started: July 7, 2005; Revised: February 6, 2009)

Math 1280 Notes 4 Last section revised, 1/31, 9:30 pm.

Part A: Answer question A1 (required), plus either question A2 or A3.

1 Two elementary results on aggregation of technologies and preferences

Solutions to Problem Set 4 Macro II (14.452)

Transcription:

Problem Set 2: Proposed solutions Econ 504 - Fall 202 Cesar E. Tamayo ctamayo@econ.rutgers.edu Department of Economics, Rutgers University Simple optimal growth (Problems &2) Suppose that we modify slightly problem by mixing it with the functional forms assumed in problem 2: : X t ln C t ; st : K t K t+ + C t ; : 0 < < > 0 C t 0; K t+ 0 K 0 given (a) The rst constraint will bind. Which property(ies) of the primitive functions ensure that?! Answer: the properties F 0 (K) > 0 and U 0 (C) > 0 ensure that the rst constraint binds. The HH (planner) can always improve any allocation that wates resources either by increasing consumption in the current period or by increasing K in the next period thereby increasing consumption from that period onwards. (b) The second constraint will never bind. Which property(ies) of the primitive functions ensure that?! Answer: the property lim C!0 U 0 (C) =. The HH (planner) can always improve upon an allocation that gives C t = 0 for some t by reducing consumption at some other date. (c) Show that the solution to this problem satis es the transversality condition (TVC).! Solution: The value function can be found to be: V (K) = F + G log K

where: G = So, The TVC is given by: ; and F = log ( ) + lim t! t+ V 0 (K t+ )K t+ = lim t+ t! ( ) log() since 0 < ; < : NOTE that is is not enough to argue that * lim t! t+ = 0; the TVC holds. You must rst show that the term V 0 (K t+ )K t+ is bounded and then you can use the discounting argument: Some of you asked about the relationship between this TVC and the one you derived in the sequential formulation lim t! t K t+ = 0. Simply recall that, in such formulation, t u C (C t ) = t so replacing in the TVC we have lim t! t u C (C t ) K t+ = 0. Finally, recall the step before reaching the Euler equation in the recursive formulation yields u C (C t ) = V 0 (K t+ ). Now replace in the TVC we have so far, yiedling lim t! t+ V 0 (K t+ ) K t+ = 0: 2 Sargent s (987) two sector model: The math of this problem is straightforward but since it is a little di erent from what you have seen so far, it is worth solving it here. In particular, it is the interpretation of the equilibrium conditions what is worth the while. First, notice that, optimal intra-period equilibrium allocations imply that the last two constraints must bind, i.e.: L t + L 2t = L t K t + K 2t = K t for, otherwise, the household would be wasting resources. To stress the intuition, suppose that an optimal plan calls for the household to supply L t. Since labor can only be used to produce in the consumption and capital goods sectors, it must be that L t = L t + L 2t. The same logic holds for Kt. Thus, we can eliminate K t and L t from our constraints. Next, we can solve the dynamic optimization problem: max L t ;L 2t ;C t K t+ ;K 2t+ X t u (C t ; L t + L 2t ) + t F (K t ; L t ) C t + t F 2 (K t ; L t ) K t+ K 2t+ and the F.O.C. are now trivially obtained as: [C t ] : t u C (C t ; L t + L 2t ) = t [L t ] : t u L (C t ; L t + L 2t ) = t F L (K t ; L t ) [L 2t ] : t u L (C t ; L t + L 2t ) = t F 2 L (K 2t ; L 2t ) [K t+ ] : t+ F K (K t+ ; L t+ ) = t [K 2t+ ] : t+ F 2 K (K 2t+ ; L 2t+ ) = t = 0 2

So we can eliminate the multipliers and nd the Euler equations: u L (C t ; L t + L 2t ) Marg disutility of labor u L (C t ; L t + L 2t ) Marg disutility of labor = u C (C t ; L t + L 2t ) MU of additional output = u C (C t+ ; L t+ + L 2t+ ) PVMU of additional output in t+ F L (K t ; L t ) MP of additional L F K (K t+ ; L t+ ) MP of additional K in t+ F 2 L (K 2t ; L 2t ) MP of additional L 2 The interpretation of the rst euqation is obvious: a consumption-leisure trade-o. The intuition behing the second equation is also straightforward: working an additional hour in the capital sector yields F 2 L (K 2t; L 2t ) additional units of capital, which can be used next period to yield F K (K t+; L t+ ) extra units of the consumption good, in turn yielding u C (C t+ ; L t+ + L 2t+ ) extra utility in t +, all of which is expressed in present value terms by using. Finally: FL 2 (K 2t+; L 2t+ ) FK 2 (K 2t+; L 2t+ ) = F L (K t+; L t+ ) FK (K t+; L t+ ) so that, at the optimum, the HH equalizes the ratios of marginal products of K and L accross sectors. 3 Optimal Linear Regulator problem and the Riccati Equation (Ex 5. in LS) Problem 5. in LS asks you to solve the linear regulator problem: ( X max t x 0 u tqx t + u 0 tqu t + 2u 0 ) thx t (ALQ) s:t: : x t+ = Ax t + Bu t (ALQ2) Now, I will NOT solve this for you. There are two reasons. First, I want you to actually try it. Second if you ever nd yourself in trouble with this exercise, you can always look at the solutions manual of LS. Instead, I will give a detailed solution for the problem (5.2.8) on page 03 of LS: ( X max t x 0 tqx t + u 0 ) tqu t (LQ) fu tg s:t: : x t+ = Ax t + Bu t ; (LQ2) again for two reasons. First, because the details of this solution are not in LS and second, because if you know how to solve (LQ)-(LQ2), you can solve (ALQ)-(ALQ2). Start by writing the problem in recursive form: V (x t ) = max u t [x 0 t Rx t + u 0 tqu t ] + V (x t+ ) s:t: : x t+ = Ax t + Bu t 3

and notice the minus in front of the brackets. This is because, in LS, the matrix Q, in addition to being symmetric, is positive de nite (PD) and therefore x 0 tqx t is a concave function (since x 0 tqx t is a quadratic form and therefore convex). Next, guess that the solution takes the form V (x) = x 0 P x where P is a PD symmetric matrix that we don t know. Replace our guess and the transition equation into the value function: x 0 P x = max u x 0 Rx u 0 Qu (Ax + Bu) 0 P (Ax + Bu) Now, if in fact V (x) = x 0 P x, then P must satisfy the F.O.C. w.r.t. u: @ x 0 Rx u 0 Qu (Ax + Bu) 0 P (Ax + Bu) at this point wee need the derivation rules: so notice that: Next,: @c 0 Kc @c @ = K + K 0 c; u 0 Qu = 0 @n 0 Kc @n = Kc; @n 0 Kc = K 0 n @c = Q + Q 0 u = 2Qu * Q = Q 0 () (Ax + Bu) 0 P (Ax + Bu) = (Ax + Bu) 0 (P Ax + P Bu) = x 0 A 0 + u 0 B 0 (P Ax + P Bu) = x 0 A 0 P Ax + x 0 A 0 P Bu + u 0 B 0 P Ax + u 0 B 0 P Bu and so using the matrix derivative rules: @ (Ax + Bu) 0 P (Ax + Bu) @x 0 A 0 P Bu = + 0 B 0 P Ax + 0 B 0 P Bu n = A 0 P B o 0 x + B 0 P Ax + 2B 0 P Bu (2) so assembling together () and (2): = B 0 P 0 Ax + B 0 P Ax + 2B 0 P Bu (3) = 2B 0 P Ax + 2B 0 P Bu * P = P 0 (4) 2Qu = 2B 0 P Ax + 2B 0 P Bu ) u = Q + B 0 P B B 0 P Ax (5) Now if we substitute the maximizer (5) back in (LQ): x 0 P x = x 0 Rx + Q + B 0 P B 0 B 0 P Ax Q Q + B 0 P B B 0 P Ax + Ax B Q + B 0 P B 0 B 0 P Ax P Ax + B Q + B 0 P B B 0 P Ax 4

and rearranging: P = R + A 0 P A 2 A 0 P B Q + B 0 P B B 0 P A So now you can solve exercise 5.. The only hint you need is: use the same guess for the value function. 4 Acemoglu 6.8 (a) The problem in recursive form can be formulated as: n V (k) = max Ak k 0 a Ak k 0 2 + V k 0 o k 0 2 (k) 2 (k) = [0; Ak] (* C 0) I will not give all the details of this problem either; just some intuition (b) The key to arguing the existence of a solution without actually nding one is to show that Theorem 6.3 (page 89 of Acemoglu s book) applies, which in turn requires assumptions 6. and 6.2 to hold. Theorem 6.3 is an existence theorem, which ensures that a continuous, bounded function that is a solution to the Bellman equation. In turn, Assumptions 6. and 6.2 concern the constraint set (k) and the convergence of P t u (C t ) to a nite number. Assumption 6.2 trivially holds since (k) has every property you can possibly want from it (non-empty, compact-valued, LHC, UHC, convex-valued, etc). The convergence property is ensured by the upper bound on k; k and 0 < < : (c) Notice that the F.O.C. and EC yield the equilibrium condition: = A + aak a + A 2 (k) + Aa k 0 = A + aak a + A 2 (k) + Aa ( (k)) and we see that there is a constant and a linear trend so a good guess for the policy function is: (k) = k + Replace in the equilibrium condition: = A + aak a + A 2 [k + ] + Aa [ (k + ) + ] and you will nd two possible solutions for. Only the one satisfying the strict monotonicity property is the unique solution to the policy rule. 5