Syllabus713Spring2010 - 6:00pm – 7:15pm at Coor 195...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
ECN 713 Natalia Kovrijnykh Spring 2010 Macroeconomic Analysis II Syllabus The main purpose of this course is to teach you tools to analyze dynamic macroeconomic models. We will start by learning basic methods of dynamic programming. We will introduce the notion of the Recursive Competitive Equilibrium and study its properties. We will apply these tools to study selected economic applications, such as optimal growth models, search models, models with heterogeneous agents, and dynamic contracts. Basic knowledge of MATLAB will be required to solve some of the homework assignments. The lectures are on Tuesdays and Thursdays, 10:30am – 11:45am at BA 390. My office hours are Wednesday 3:00pm – 5:00pm or by appointment. My office is BAC 653. You can also reach me by email [email protected] or by phone (480) 965-7158. The TA for this course is Kevin Donovan, [email protected] , BAC 680. He will do homework grading and conduct occasional TA sessions. TA sessions are on (some) Tuesdays,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6:00pm – 7:15pm at Coor 195. Kevin’s office hours are by appointment. Reading: The main references for this course are 1 . Recursive Methods in Economic Dynamics , by Nancy L. Stokey and Robert E. Lucas, Jr., with Edward C. Prescott, 1989. Harvard University Press, Cambridge, Massachussets (hereafter SLP). 2. Recursive Macroeconomic Theory , by Lars Ljungqvist and Thomas J. Sargent, Second Edition, 2004. The MIT Press, Cambridge, Massachussets (hereafter LS). Course Requirements: Your grade will be determined based on homework assignments (25%), a midterm (25%), and a final (50%). All the course materials will be posted on the Blackboard. If you have any problems getting into the Blackboard, contact [email protected] . Tentative Agenda (subject to change): 1. Dynamic Programming SLP Ch. 2.1, 2.2, 3, 4.1, 4.2 2. Search Theory LS Ch. 6 3. Recursive Competitive Equilibrium SLP Ch. 2.3, LS Ch. 12 4. Models with Heterogeneous Agents LS Ch. 17 5. Dynamic Contracts LS Ch. 19, 20, 21...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online