Optimal Transport Notebooks

Linear programming

  • A crash course in Linear Programming

  • Stigler's diet: Optimal nutrition

image_edited.png

Optimal assignment

  • Introduction to Optimal Transport

  • Optimal Assignment problem

wedding-rings-g8e0e458cc_1920 (1).jpg

Regularized optimal transport

  • Entropic regularization

  • Gradient Descent

  • IPFP/Sinkhorn

Entropic.png

Characteristics model

  • The pure characteristics model

  • BLP random coefficient model

Capture.jpg

Network flow problems

  • Network Topology

  • Min-cost flow problem

  • The shortest-path problem

communication-g437fb753c_1920 (1).jpg

One dimensional transport

  • Copulas and comonotonicity

  • Positive assortative matching

  • The wage equation

Commercial Buildings

Random utility models

  • EMax operator

  • Daly-Sachary-Williams theorem

  • The MEV class

2048px-2-Dice-Icon.svg.png

Matching estimation

  • The Choo and Siow model

  • The marriage market

marriage.jpg

Dynamic programming

  • A crash course in Dynamic Programming

  • Markov processes

  • Algorithms for DP

Shortest_path_optimal_substructure.svg.png

Semi-discrete OT

  • Semi-Discrete Optimal Transport

  • Voronoi Tesselations

  • Aurenhammer's method

Voronoi-cells-on-a-2D-surface-Illustrated-is-the-capture-zone-areas-for-randomly.png

Discrete choice estimation

  • Estimation with and without observable heterogeneity

choice.jpg

Gravity equation

  • The gravity equation

  • Predicting trade flows

trade.jpg

In order to execute the code from your browser, you may try the MyBinder version of the notebooks here. (Setting up the online notebook may take a few minutes.)