top of page

'math+econ+code' masterclass

Season 1: linear programming

and economic applications

June 20-22, 2023

This intensive course, first part of the ‘math+econ+code’ series, is focused on linear programming and economic applications, and will include basics of linear programming (duality and the simplex algorithm), and applications to microeconomics (optimal assignments) and to spatial economics (minimum-cost flows), to game theory (zero-sum games), and to econometrics (quantile regression). It will introduce tools from economics, mathematics, econometrics and computing, on a needs basis, without any particular prerequisite other than the equivalent of a first year graduate sequence in econ or in applied math.
Because it aims at providing a bridge between theory and practice, the teaching format is somewhat unusual: each teaching “block” will be made of a mix of theory and coding (in Python), based on an empirical application related to the theory just seen. Students will have the opportunity to write their own code, which is expected to be operational at the end of each block. This course is therefore closer to cooking lessons than to traditional lectures.


Practical information

  • The course will be taught over three consecutive days, Jun 20-22 2023, 9am-11am NY time, 3pm-5pm Paris time.

  • The instructor is Alfred Galichon (professor of economics and of mathematics at NYU and principal investigator of the ERC-funded project 'equiprice' at Sciences Po). 

  • The Graduate Assistant for this masterclass will be Maxime Sylvestre, from Université Paris Dauphine-PSL

  • Applications are now open: you can apply here

Course outline

Day 1: Linear programming introduction & the simplex

  • Formulation of the problem

  • Duality

  • The diet problem


  • The simplex algorithm

Day 3: Zero-sum games & quantile regression

  • Minimax theory

  • LP formulation of zero-sum games

  • Primal-dual algorithms

  • Quantile via loss functions

  • Quantile regression

Day 2: Optimal assignment & network flow problems

  • Optimal assignment

  • Monge-Kantorovich duality

  • Stable matchings 

  • Networks flow problems​

  • Equilibrium interpretation

  • Shortest path problem

bottom of page