Identification and Efficiency Bounds for the Average Match Function Under Conditionally Exogenous Matching

Identification and Efficiency Bounds for the Average Match Function Under Conditionally Exogenous Matching

By
Bryan S. Graham, Guido W. Imbens, Geert Ridder
Journal of Business & Economic Statistics. April
2020, Vol. 38, Issue 2, Pages 303–316

Consider two heterogenous populations of agents who, when matched, jointly produce an output, Y. For example, teachers and classrooms of students together produce achievement, parents raise children, whose life outcomes vary in adulthood, assembly plant managers and workers produce a certain number of cars per month, and lieutenants and their platoons vary in unit effectiveness. Let W ∈ W = { w 1 , … , w J } and X ∈ X = { x 1 , … , x K } denote agent types in the two populations. Consider the following matching mechanism: take a random draw from the W = wj subgroup of the first population and match her with an independent random draw from the X = xk subgroup of the second population. Let β(wj, xk), the average match function (AMF), denote the expected output associated with this match. We show that:

  1. The AMF is identified when matching is conditionally exogenous
  2. Conditionally exogenous matching is compatible with a pairwise stable aggregate matching equilibrium under specific informational assumptions
  3. We calculate the AMF’s semiparametric efficiency bound