Collaborative gathering on “Inference on the equilibrium flow problem”

Organized by Alfred Galichon (NYU and Sciences Po)

This project seeks to build a general framework for estimation of the “equilibrium flow problem”. The “equilibrium flow problem,” extends minimum cost flow problems in order to provide a unified network-based framework to analyze problems such as matching problems, multinomial choice problems, hedonic pricing problems, shortest path problems, dynamic programming problems, international trade flows.