1 / 10

ULTIMATCH: Matching on Observables for Counterfactual Analysis

This presentation at the London Stata Conference introduces ULTIMATCH, a powerful tool for score-based, distance-based, and coarsened exact matching. ULTIMATCH allows users to exploit correlations and perform matching on observables to obtain reliable counterfactual estimates.

wilburd
Download Presentation

ULTIMATCH: Matching on Observables for Counterfactual Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ULTIMATCHmatching counterfactuals your way Thorsten DoherrLondon Stata ConferenceSeptember 6,2019 https://github.com/ThorstenDoherr/ultimatch

  2. Why matching? exploiting the correlations: matching on observables

  3. ULTIMATCH • Score-based matching • ultimatchscorevar, treated(treated_dummy) • [exact(vars_defining_cells)] • [caliper(max_score_difference)] • [draw(num_of_counterfactuals)] • [copy [full]] • [single] • [support] • [between] • [radius] • [greedy] • [rank] • [euclid] • [mahalanobis] • [report(vars_for_ttests) [unmatched]] • [unit(vars_clustering_obs)] • [exp(logical_exp)] • [limit(perc_rank_limitations)] • Distance-based matching • ultimatchdvar1 dvar2…, treated(treated_dummy) • [exact(vars_defining_cells)] • [caliper(max_distance_difference)] • [draw(num_of_counterfactuals)] • [copy [full]] • [single] • [support] • [between] • [radius] • [greedy] • [rank] • [euclid] • [mahalanobis] • [report(vars_for_ttests) [unmatched]] • [unit(vars_clustering_obs)] • [exp(logical_exp)] • [limit(perc_rank_limitations)] • Coarsened exact matching • ultimatch, treated(treated_dummy) • exact(vars_defining_cells) • [caliper(max_diff)] • [draw(num_of_counterfactuals)] • [copy [full]] • [single] • [support] • [between] • [radius] • [greedy] • [rank] • [euclid] • [mahalanobis] • [report(vars_for_ttests) [unmatched]] • [unit(vars_clustering_obs)] • [exp(logical_exp)] • [limit(perc_rank_limitations)] Transformation . egen long coarsescore = group(cell1 cell2 cell3…) . ultimatchcoarsescore, treated(treated) caliper(0.5)

  4. Score-based matching SORT MATCH

  5. Distance-based matching

  6. Hypersphere-Leeway Algorithm

  7. ultimatch y x, treated(treated) euclid

  8. ultimatch y x, treated(treated) mahalanobis

  9. ultimatch y x, treated(treated) caliper(0.15) radius euclid

  10. Thank you https://github.com/ThorstenDoherr/ultimatch

More Related