my attempt to make it understadable for slow reader as myself:
Following Sigstad (2026), we estimate each prosecutor’s stringency as their incarceration rate across the four cases in their vignette group, \(\hat p_i=K^{-1}\sum_{k=1}^{K}D_{ik}\). We rank prosecutors within each group by this stringency rate, breaking ties with small random noise. For each case, the IA violation indicator equals one if any less stringent prosecutor recommends incarceration while a more stringent prosecutor does not, and zero otherwise. The case-level IA violation rate is the share of cases with at least one such reversal, averaged equally across groups. Note that these measures depend only on prosecutors’ ranking, not on the numerical differences between their stringencies.
Average monotonicity instead depends on the case-level weights \(w_k=\operatorname{Cov}i(\hat p_i,D{ik})/\operatorname{Var}i(\hat p_i)\), calculated within each group. A case receives a negative weight when prosecutors who recommend incarceration are, on average, less stringent than those who do not. We report both the share of cases with negative weights and the sum of those weights, averaging each measure equally across groups. The former captures the incidence of average-monotonicity violations; the latter captures their magnitude. Their implications for the 2SLS estimand depend on treatment-effect heterogeneity, as illustrated in Section 4.2. Because these measures depend on numerical stringencies, we assess robustness using three encodings: the incarceration rate, mean incarceration length, and ordinal sentence severity.
Our primary statistic is the pairwise violation rate. For each pair of prosecutors \(i\) and \(j\) within the same group, let \(n{ij}=\sum_k D_{ik}(1-D_{jk})\) count cases in which \(i\) recommends incarceration and \(j\) does not. We calculate
[
VR=
\frac{\sum_{i<j}\min(n_{ij},n_{ji})}
{\sum_{i<j}(n_{ij}+n_{ji})}
]
within each group and average the resulting rates equally across groups. For each pair, the numerator counts disagreements in the less frequent direction, while the denominator counts all disagreements. Thus, the statistic measures the share of disagreements that run against the pair’s predominant ordering. For binary decisions, this is equivalent to counting reversals of the stringency ranking: \(\hat p_i-\hat p_j=(n_{ij}-n_{ji})/K\). When stringencies are tied, \(n_{ij}=n_{ji}\), so either ordering produces the same number of reversals. The pairwise rate is therefore invariant to the tie-breaking draw.