A Note on Optimal Matching With Variable Controls Using the Assignment Algorithm

By Kewei Ming, Paul R. Rosenbaum. 2001

111 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/a5d719b4f657b4a7c2286ccaacda6d0573e5c714

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Paul R. Rosenbaum
2. Larry A. Wasserman
3. Bodhisattva Sen
4. Nabarun Deb
5. José R. Zubizarreta
6. Max Sommerfeld
7. M. Resa
8. Axel Munk

In Statistics and Probability

1. Paul R. Rosenbaum
2. Ben B. Hansen
3. S. Klopfer
4. José R. Zubizarreta
5. Jennifer L. Hill
6. Kosuke Imai
7. Dylan S. Small
8. Elizabeth A. Stuart

Citations in the corpus

• Covariance Adjustment in Randomized Experiments and Observational Studies (2002, methodology): “Implementation in SAS has been discussed by Bergstralh, Kosanke and Jacobsen (1996) and Ming and Rosenbaum (2001).”
• Optimal Full Matching and Related Designs via Network Flows (2006, background): “for problems that forbid many-one matches, only, Ming and Rosenbaum (2001) describe an optimal matching algorithm with a slightly better time complexity bound, namely O(n3).”