UC Berkeley

 

Requirements for a grade in the course (including P/NP): Problem sets (approximately 6-8 of these) and final exam.

You can work on problem sets in groups no larger than 3.  If you turn in a group answer, be sure that everyone signs their name.

 

Summary of past lectures

Lecture notes

 

Chapter 1 (Basics of dynamic optimization) 9/9/2010

Figures for Chapter 1

Technical appendix

Chapter 2 (Taxes Vs Quota and the LQ problem) 9/15/2010

Figures for Chapter 2

Chapter 3 (Reactions to risk) 9/15/2010

Figures for Chapter 3

Chapter 4 (Anticipated learning, 2 periods) 9/15/2010

Figures for Chapter 4

Chapter 5 (Anticipated learning, multiperiod) 9/15/2010

Figures for Chapter 5

Chapter 6 (Basics of continuous time dynamics) 9/9/2010

Figures for Chapter 6

 

Problem sets and solutions

Problem set # 1, due September 7: Problems at end of Chapter 1 (first set of lecture notes).  Your suggestions and corrections for Chapter 1 of the notes.  (Please be specific.  The purpose of this part of the assignment (for you) is to give you an incentive to read the notes caredfully, and (for us) to help us improve the notes.

 

 

Problem set #2 due September 16: Problem at end of Chapter 2 (the chapter on the linear-quadratic problem).  The second and third problems are based on

P vs Q mulitiplicative

P vs Q additive

 

Problem set # 3

Model description and problem

Matlab code

*****************************************************************

Material below this line has not been edited for 2010

Summary of lectures

Text Box: Course requirements:

Text Box: (i)   Approximately half a dozen problem sets

Text Box: (ii)  A final exam. 

List of topics:

1. Basics of dynamic programming (discrete time)

2. The linear-quadratic model

3. Learning about unknown parameters

4. Numerical solutions to dynamic problems

5. Introduction to continuous time dynamics 

6. The Calculus of Variations (COV)

7. The Maximum Principle

8. The dynamic programming equation in continuous time

9. Event uncertainty

10. Non-convex control problems

11. Time consistency

12. Discounting

13. (Learning under) Ambiguity

14. Continuous time stochastic control and optimal stopping

15. Disentangling intertemporal substitutability from risk aversion

ScientificWorkplace is installed in the stat lab rm 236 Giannini on the left-most Windows computer -- viewed as if standing in the doorway. 

The host name of the computer is gia236a.are.berkeley.edu, although that name is not prominently displayed on the machine.


Office Hours:

Larry Karp: Fridays 9-10am or by appointment, 206 Giannini Hall
Christian Traeger: Thursdays 5-6pm or by appointment, 322 Giannini Hall

Class Notes:

· Comparative statics and the Euler Equation

· The Linear-Quadratic problem

· Learning

· A two-period version of Krugman's model

· Notes on Krugman's model

· Marc Mangel's notes

· Larry Karp's "Depreciation erodes the Coase Conjecture", European Economic Review 40 : 473 - 490 (1996).

· Non-convex Control Problems

· Hyperbolic discounting

· Time, Risk, and Uncertainty

 

 

 

Problem sets and solutions:

Problem set 1 (due Sept 9)

Problem set 2  Paper needed for problem set  Hint/solution for the first problem (due Sept 16)

Problem set 3  Gams file erc Gams file erm (due Sept 23)   Solution PS 3

Problem set 4  (due October 9)

Problem set 5  (Due October 28)  Matlab predator_prey  Matlab prey  Solution PS 5

Problem set 6  (Due November 18)  Solution PS 6

 

 

Old exams:

exam 2001     exam 2002  exam 2003   exam 2004 and key  exam 2006 and key

 

 

Old lecture notes from previous years:

Part 1: Basic Ideas of ODE's

 

Part 2: Calculus of Variations

Part 3: The Maximum Principle

Part 4: Uncertainty

Part 5: Dynamic Programming

Part 6: Two Schochastic Control Problems

Part 7: Limit Cycles in Intertemporal Adjustment Models

Part 8: "Nonconvex" Control Problems

Part 9:  Linear Control Problems

Part 10: Dynamic Games Reading List for Games

 

 

 

ARE 263

Methods of Dynamic Analysis and Control