Advertisement

Constructing Matched Sets and Strata

  • Paul R. Rosenbaum
Part of the Springer Series in Statistics book series (SSS)

Abstract

This chapter discusses the construction of matched sets or strata when there are several, perhaps many, observed covariates x. There are three topics: the propensity score, the form of an optimal stratification, and the construction of optimal matched sets. This introduction summarizes the main issues and findings.

Keywords

Weight Function Propensity Score Total Distance Pair Match Treated Subject 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertsekas, D. (1991). Linear Network Optimization: Algorithms and Codes. Cambridge MA: MIT Press.zbMATHGoogle Scholar
  2. Carpenter, R. (1977). Matching when covariables are normally distributed. Biometrika, 64, 299–307.zbMATHCrossRefGoogle Scholar
  3. Cochran, W.G. (1968). The effectiveness of adjustment by subclassification in removing bias in observational studies. Biometrics, 24, 205–213.MathSciNetCrossRefGoogle Scholar
  4. Cochran, W.G. and Rubin, D.B. (1973). Controlling bias in observational studies: A review. Sankya, Series A, 35, 417–446.zbMATHGoogle Scholar
  5. Cox, D.R. (1970). The Analysis of Binary Data. London: Methuen.zbMATHGoogle Scholar
  6. Cox, D.R. and Snell, E.J. (1981). Applied Statistics: Principles and Examples. London: Chapman & Hall.zbMATHGoogle Scholar
  7. Ford, L. and Fulkerson, D. (1962). Flows in Networks. Princeton, NJ: Princeton University Press.zbMATHGoogle Scholar
  8. Gu, X.S. and Rosenbaum, P.R. (1993). Comparison of multivariate matching methods: Structures, distances and algorithms. Journal of Computational and Graphical Statistics, 2, 405–420.Google Scholar
  9. Kuhn, H.W. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2, 83–97.MathSciNetCrossRefGoogle Scholar
  10. Papadimitriou, C. and Steiglitz, K. (1982). Combinatorial Optimization. Englewood Cliffs, NJ: Prentice-Hall.zbMATHGoogle Scholar
  11. Rockafellar, R.T. (1984). Network Flows and Monotropic Optimization. New York: Wiley.zbMATHGoogle Scholar
  12. Rosenbaum, P.R. (1984). Conditional permutation tests and the propensity score in observational studies. Journal of the American Statistical Association, 79, 565–574.MathSciNetCrossRefGoogle Scholar
  13. Rosenbaum, P. (1989). Optimal matching for observational studies. Journal of the American Statistical Association, 84, 1024–1032.CrossRefGoogle Scholar
  14. Rosenbaum, P.R. (1991). A characterization of optimal designs for observational studies. Journal of the Royal Statistical Society, Series B, 53, 597–610.MathSciNetzbMATHGoogle Scholar
  15. Rosenbaum, P. and Rubin, D. (1983). The central role of the propensity score in observational studies for causal effects. Biometrika, 70, 41–55.MathSciNetzbMATHCrossRefGoogle Scholar
  16. Rosenbaum, P. and Rubin, D. (1984). Reducing bias in observational studies using subclassification on the propensity score. Journal of the American Statistical Association, 79, 516–524.CrossRefGoogle Scholar
  17. Rosenbaum, P. and Rubin, D. (1985). Constructing a control group using multivariate matched sampling methods that incorporate the propensity score. American Statistician, 39, 33–38.Google Scholar
  18. Rubin, D.B. (1973). The use of matched sampling and regression adjustment to remove bias in observational studies. Biometrics, 29, 185–203.CrossRefGoogle Scholar
  19. Rubin, D.B. (1979). Using multivariate matched sampling and regression adjustment to control bias in observational studies. Journal of the American Statistical Association, 74, 318–328.zbMATHGoogle Scholar
  20. Rubin, D.B. (1980). Bias reduction using Mahalanobis metric matching. Biometrics, 36, 293–298.zbMATHCrossRefGoogle Scholar
  21. Smith, A., Kark, J., Cassel, J., and Spears, G. (1977). Analysis of prospective epidemiologic studies by minimum distance case-control matching. American Journal of Epidemiology,105, 567–574.Google Scholar
  22. Tarjan, R. (1983). Data Structures and Network Algorithms. Philadelphia: Society for Industrial and Applied Mathematics.CrossRefGoogle Scholar
  23. Walkup, D. (1979). On the expected value of a random assignment problem. SIAM Journal on Computing, 8, 440–442.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Paul R. Rosenbaum
    • 1
  1. 1.Department of StatisticsUniversity of PennsylvaniaPhiladelphiaUSA

Personalised recommendations