REVIEW 5 cited by
Evidence Aggregation for Treatment Choice
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Consider a planner who has limited knowledge of the policy's causal impact on a certain local population of interest due to a lack of data, but does have access to the publicized intervention studies performed for similar policies on different populations. How should the planner make use of and aggregate this existing evidence to make her policy decision? Following Manski (2020; Towards Credible Patient-Centered Meta-Analysis, \textit{Epidemiology}), we formulate the planner's problem as a statistical decision problem with a social welfare objective, and solve for an optimal aggregation rule under the minimax-regret criterion. We investigate the analytical properties, computational feasibility, and welfare regret performance of this rule. We apply the minimax regret decision rule to decide whether to enact an active labor market policy based on 14 randomized control trial studies.
Forward citations
Cited by 5 Pith papers
-
Dynamically Consistent Statistical Decisions
Frequentist minimax rules often lack interim credibility; two axiomatized dynamically consistent criteria restore it while nesting Manski as-if and Gamma*-minimax.
-
Optimal treatment assignment rules under capacity constraints
Under capacity constraints, the optimal treatment assignment problem can be rewritten as an optimal transport problem, where a Bayesian rule is locally asymptotically optimal and the plug-in rule is not when welfare i...
-
Evidence aggregation with ignorance in mind: learning what we do (not) know for archetypes discovery
A framework jointly learns treatment-effect archetypes and a basin of ignorance, abstaining where generalization is unsupported, with regret and inference guarantees.
-
When and How to Pilot: Design Rules for Two-Wave Experiments
A finite-sample decision rule that lets a pilot's variance estimates move the main-wave treatment allocation toward the Neyman allocation only as far as a confidence set allows, with a worst-case regret certificate.
-
Who With Whom? Learning Optimal Matching Policies
An entropy-regularized optimal transport method learns welfare-optimal two-sided matching policies with estimated costs, supported by a non-asymptotic regret bound and calibrated simulations suggesting about one perce...
Discussion (0). Continue with ORCID to comment.