Graded Matching for Large Observational Studies

DOI10.1080/10618600.2022.2058001OpenAlexW4220750401MaRDI QIDQ5057279

Paul R. Rosenbaum, Ruoqi Yu

Publication date: 16 December 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10618600.2022.2058001

zbMATH Keywords

network optimizationobservational studyoptimal matchingfine balancerank maximal matching

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (1)

RBestMatch

Uses Software

• R
• mipmatch
• nbpMatching
• optmatch
• rcbalance

Cites Work

• Unnamed Item
• How Changes in Financial Incentives Affect the Duration of Unemployment
• Two special cases of the assignment problem
• Matching methods for observational studies derived from large administrative databases
• Comment: Matching methods for observational studies derived from large administrative databases
• Reducing rank-maximal to maximum weight matching
• Rank-maximal matchings
• Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure After Surgery
• Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies
• Directional penalties for optimal matching in observational studies
• Optimal Tradeoffs in Matched Designs Comparing US-Trained and Internationally Trained Surgeons
• Replication and Evidence Factors in Observational Studies
• Minimum Distance Matched Sampling With Fine Balance in an Observational Study of Treatment for Ovarian Cancer
• Combinatorial optimization. Theory and algorithms.
• Design of observational studies

This page was built for publication: Graded Matching for Large Observational Studies