In: Journal of Business and Economic Statistics, 2020, vol. 38, no. 1, p. 183-200
This article investigates the finite sample properties of a range of inference methods for propensity score-based matching and weighting estimators frequently applied to evaluate the average treatment effect on the treated. We analyze both asymptotic approximations and bootstrap methods for computing variances and confidence intervals in our simulation designs, which are based on German...
|
In: International Journal of Computer Vision, 2012, vol. 98, no. 2, p. 217-241
|
(Working Papers SES ; 467)
Based on empirical data from selected public universities in Khabarovsk, Russia, this paper compares first and fifth year students regarding their attitudes towards corruption in general and university corruption in particular. Even after making both groups of students comparable with respect to a range of socio-economic characteristics by a matching approach, the results suggest that fifth year...
|
In: European Journal of Higher Education, 2016, vol. 6, no. 2, p. 128-143
Based on empirical data from selected public universities in Khabarovsk, Russia, this paper compares first and fifth year students regarding their attitudes towards corruption in general and university corruption in particular. Even after making both groups of students comparable with respect to a range of socio-economic characteristics by a matching approach, the results suggest that fifth...
|
In: Discrete Applied Mathematics, 2016, vol. 207, p. 45–55
Given a graph G that admits a perfect matching, we investigate the parameter η(G) (originally motivated by computer graphics applications) which is defined as follows. Among all nonnegative edge weight assignments, η(G) is the minimum ratio between (i) the maximum weight of a perfect matching and (ii) the maximum weight of a general matching. In this paper, we determine the exact value of η...
|
In: Review of Economic Studies, 2013, vol. 80, no. 3, p. 1114-1147
|
In: Discrete Mathematics, 2009, vol. 309, p. 4306-4314
Given an undirected graph G=(V,E) with matching number \nu(G), we define d- blockers as subsets of edges B such that \nu(G=(V,E\B))\leq \nu(G)-d. We define d- transversals T as subsets of edges such that every maximum matching M has |M\cap T|\geq d. We explore connections between d-blockers and d-transversals. Special classes of graphs are examined which include complete graphs, regular...
|