Open Access
March 2018 Covariate balancing propensity score for a continuous treatment: Application to the efficacy of political advertisements
Christian Fong, Chad Hazlett, Kosuke Imai
Ann. Appl. Stat. 12(1): 156-177 (March 2018). DOI: 10.1214/17-AOAS1101

Abstract

Propensity score matching and weighting are popular methods when estimating causal effects in observational studies. Beyond the assumption of unconfoundedness, however, these methods also require the model for the propensity score to be correctly specified. The recently proposed covariate balancing propensity score (CBPS) methodology increases the robustness to model misspecification by directly optimizing sample covariate balance between the treatment and control groups. In this paper, we extend the CBPS to a continuous treatment. We propose the covariate balancing generalized propensity score (CBGPS) methodology, which minimizes the association between covariates and the treatment. We develop both parametric and nonparametric approaches and show their superior performance over the standard maximum likelihood estimation in a simulation study. The CBGPS methodology is applied to an observational study, whose goal is to estimate the causal effects of political advertisements on campaign contributions. We also provide open-source software that implements the proposed methods.

Citation

Download Citation

Christian Fong. Chad Hazlett. Kosuke Imai. "Covariate balancing propensity score for a continuous treatment: Application to the efficacy of political advertisements." Ann. Appl. Stat. 12 (1) 156 - 177, March 2018. https://doi.org/10.1214/17-AOAS1101

Information

Received: 1 January 2017; Revised: 1 June 2017; Published: March 2018
First available in Project Euclid: 9 March 2018

zbMATH: 06894702
MathSciNet: MR3773389
Digital Object Identifier: 10.1214/17-AOAS1101

Keywords: Causal inference , covariate balance , generalized propensity score , inverse-probability weighting , treatment effect

Rights: Copyright © 2018 Institute of Mathematical Statistics

Vol.12 • No. 1 • March 2018
Back to Top