Concepts of matching are introduced by building three matched samples for the binge drinking example. Each matched sample is a solution to an optimization problem, and each is implemented by finding a minimum cost flow in a network. The third matched sample is judged the best of these three: It pairs closely for important covariates and balances other covariates.