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

Graham, Bryan S.

Identification and Efficiency Bounds for the Average Match Function under Conditionally Exogenous Matching / Bryan S. Graham, Guido W. Imbens, Geert Ridder. - Cambridge, Mass. National Bureau of Economic Research 2016. - 1 online resource: illustrations (black and white); - NBER working paper series no. w22098 . - Working Paper Series (National Bureau of Economic Research) no. w22098. .

March 2016.

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\in\mathbb= and X\in\mathbb=` denote agent types in the two populations. Consider the following matching mechanism: take a random draw from the `W=w_j` subgroup of the first population and match her with an independent random draw from the `X=x_k` subgroup of the second population. Let `beta(w_j,x_k)`, the average match function (AMF), denote the expected output associated with this match. We show that (i) the AMF is identified when matching is conditionally exogenous, (ii) conditionally exogenous matching is compatible with a pairwise stable aggregate matching equilibrium under specific informational assumptions, and (iii) we calculate the AMF's semiparametric efficiency bound.




System requirements: Adobe [Acrobat] Reader required for PDF files.
Mode of access: World Wide Web.

Powered by Koha