Skip to content

jdebacker/CompEcon_Fall19

Repository files navigation

ECON 815: Computational Methods for Economists (Fall 2019)

Jason DeBacker
Email jason.debacker@moore.sc.edu
Office 427B DMSB
Office Hours T 2:40-4:40pm, Th 2:40-4:40pm, or by appointment
GitHub jdebacker
  • Meeting day/time: T,Th 1:15-2:30pm, DMSB, Room 108
  • Office hours also available by appointment

Course description

This course is designed to introduce PhD students to software applications and computational techniques to make them productive researchers. Students will be exposed to leading open source software packages (Python, R) and techniques for numerical computing and data analysis. The course will be taught through the application of these software packages and methods to economic research in applied microeconomics and quantitative macroeconomics.

Course Objectives and Learning Outcomes

In this course students, through lecture and application, students will learn about:

  • Software to increase research productivity including:
    • TeX
    • git
    • Python
    • R
  • How to write custom estimation routines and use packages written by others for:
    • Generalized method of moments estimators
    • Maximum likelihood estimators
    • Maximum score estimators
    • Reduced form estimators such as regression discontinuity design
    • Simulated method of moment estimators
  • Computational methods to:
    • Optimize and find roots of functions
    • Solve dynamic programming problems (disceret and continous choice)
    • Solve general equilibrium, heterogeneous agent models
    • Perform Monte Carlo simulations
    • Bootstrap standard errors
    • Compute numerical derivatives
    • Use just-in-time compilation for efficient computation
    • Run computations in parallel using multiple processors
  • Methods to gather and handle data including:
    • Costs and benefits of different data structures
    • Using APIs
    • Web scraping
  • Coding and collaboration techniques such as:
    • Writing modular code with functions and objects
    • Collaboration tools for writing code using Git and GitHub.com.
    • Best practices for Python coding (PEP 8)

Grades

Grades will be based on the categories listed below with the corresponding weights.

Assignment Points Percent
Problem Sets 90 90%
Class Participation 10 10.0%
Total points 100 100.0%
  • Homework: I will assign 9 problem sets throughout the semester.
    • You must write and submit your own computer code, although I encourage you to collaborate with your fellow students. I DO NOT want to see a bunch of copies of identical code. I DO want to see each of you learning how to code these problems so that you could do it on your own.
    • Problem set solutions, both written and code portions, will be turned in via a pull request from your private GitHub.com repository which is a fork of the class master repository on my account. (You will need to set up a GitHub account if you do not already have one.)
    • Written solutions must be submitted as pdf documents or Jupyter Notebooks.
    • Problem sets will be due on the day listed in the Daily Course Schedule section of this syllabus (see below) unless otherwise specified. Late homework will not be graded.

Daily Course Schedule

Date Day Topic Due
Aug. 22 Th Work Flow, Productivity Software
Aug. 27 T Work Flow, Productivity Software
Aug. 29 Th Python/OOP
Sept. 3 T Python/OOP PS #1
Sept. 5 Th Python/OOP
Sept. 10 T Numerical Optimization Theory
Sept. 12 Th Numerical Optimization Theory PS #2
Sept. 17 T Optimizers, Root-Finders in Python
Sept. 19 Th Optimization Application: GMM
Sept. 24 T Two-Sided Matching Models
Sept. 26 Th Maximum Score Estimators
Oct. 1 T Conditionals/Loops PS #3
Oct. 3 Th Vizualization
Oct. 8 T Econometrics in Python and R
Oct. 10 Th No class, Fall Break
Oct. 15 T Econometrics in Python and R PS #4
Oct. 17 Th Webscraping/APIs to gather data
Oct. 22 T Webscraping/APIs to gather data
Oct. 24 Th Webscraping/APIs to gather data
Oct. 29 T Dynamic Programming PS #5
Oct. 31 Th Dynamic Programming
Nov. 5 T Markov Chains
Nov. 7 Th Discrete Choice Dynamic Programming
Nov. 12 T Computational Approaches to DPPs PS #6
Nov. 14 Th Multiprocessing
Nov. 19 T Simulation Methods
Nov. 21 Th Simulation Methods PS #7
Nov. 26 T Overlapping Generations Models
Nov. 28 Th No class, Thanksgiving
Dec. 3 T Overlapping Generations Models PS # 8
Dec. 5 Th Overlapping Generations Models
Dec. 10 T No Final Exam - project due PS #9

Helpful Links

Reasonable Accommodations for Students with Disabilities:

If you have any condition, such as a physical or learning disability, which will make it difficult for you to carry out the work as I have outlined it or which will require academic accommodations, please notify me through email AND in person with the appropriate documentation within the first two weeks of the course. Please also copy the course TA to this message.

About

ECON 815: Computational Methods for Economists

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published