Spring 2024 - ECON 832 G100

Computational Methods in Economics (4)

Class Number: 4263

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 8 – Apr 12, 2024: Fri, 12:30–3:20 p.m.
    Burnaby

  • Prerequisites:

    ECON 802, 807 or 808, or with the approval of the instructor.

Description

CALENDAR DESCRIPTION:

The first part of the course will focus on dynamic optimization problems, with an emphasis on dynamic programming. Applications may include growth, business cycles, monetary and fiscal policy, and optimal contracts. The second part of the course will focus on models of learning and bounded rationality. Genetic and stochastic approximation algorithms will be studied. Applications may include the stability of rational expectations equilibria, the evolution of institutions and social conventions, and models of robust control and Knightian uncertainty.

COURSE DETAILS:

This graduate course offers a dive into Computational Economics, emphasizing the use of numerical simulations and both parametric and nonparametric structural modelling to unpack complex economic systems. Students will explore parametric and nonparametric structural approaches to market competition and international trade. Cutting-edge nonparametric methods will be explored, focusing on the entropic latent variable integration for demand modelling and nonparametric finite mixture models that allow rich heterogeneity of consumers. The class also integrates Machine Learning and Deep Learning, teaching students to deploy neural networks and clustering for economic analysis.

The expected outcome of this class is to produce a short paper using computational economics tools applied to any economic problem.

Topics: (Not Exhaustive)
1. Numerical and Simulation Methods
2. Parametric Structural Modelling
   2.1 Models of Differentiated Competition
   2.2 Gravity Models of Trade
3. Nonparametric Structural Modelling
   3.1. Nonparametric Modelling of Demand using Entropic Latent Variable Integration Via Simulation
   3.2. Nonparametric Modelling of Heterogeneous Decision Makers using Finite Mixture Techniques
4. Machine Learning and Deep Learning
   4.1 Deep Feedforward Networks
   4.2 Clustering Methods in Economics

Grading

  • Midterm exam 35%
  • Class assignments and presentations 25%
  • Class discussion 10%
  • Term Paper 30%

NOTES:

Prerequisites: Some background on programming is desirable, we will be using Julia language but no previous knowledge of it is required.

Materials

REQUIRED READING:

class lecture notes and readings/papers that will uploaded in the online class.

REQUIRED READING NOTES:

Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.

Graduate Studies Notes:

Important dates and deadlines for graduate students are found here: http://www.sfu.ca/dean-gradstudies/current/important_dates/guidelines.html. The deadline to drop a course with a 100% refund is the end of week 2. The deadline to drop with no notation on your transcript is the end of week 3.

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

SFU’s Academic Integrity website http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating. Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the university community. Academic dishonesty, in whatever form, is ultimately destructive of the values of the university. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the university. http://www.sfu.ca/policies/gazette/student/s10-01.html