A fast algorithm for maximal propensity score matching

DOI10.1007/s11009-019-09718-4zbMath1448.92010arXiv1701.02201OpenAlexW3103697180MaRDI QIDQ2195942

P. S. Ruzankin

Publication date: 28 August 2020

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.02201

zbMATH Keywords

propensity score matchingnearest neighbor matchingmatching with calipervariable width caliper

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) General biostatistics (92B15) Medical applications (general) (92C50)

Related Items (1)

Comment: Matching methods for observational studies derived from large administrative databases

Cites Work

• Efficient many-to-Many point matching in one dimension
• Construction of the Optimal Joint Distribution of Two Random Variables
• The central role of the propensity score in observational studies for causal effects
• The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications

This page was built for publication: A fast algorithm for maximal propensity score matching