---
title: 'Veto: Applications in Science and Decision Theory'
url: https://www.emergentmind.com/topics/veto
type: topic
---

# Veto: Applications in Science and Decision Theory

Searching arXiv for the cited papers to ground the article and verify metadata.
Veto denotes a blocking or exclusion rule that suppresses an event, outcome, candidate, or state when ancillary evidence or structural constraints indicate that it should not survive. In the literature, the term ranges from temporal anticoincidence logic in gravitational-wave searches, to active detector subsystems that tag cosmogenic or hadronic backgrounds, to jet-activity exclusions in collider analyses, to minority-protection and delegation rules in voting and bargaining, and to formal objects such as Boolean veto functions and veto interval graphs [2601.02713] [1811.06739] [1405.3669] [1709.09259].

## 1. Core meanings and formal patterns

A recurrent structure of veto rules is that acceptance is not determined solely by the candidate object itself, but by an additional negative condition. In the gravitational-wave anticoincidence setting, a trigger is vetoed when it is unusually loud in one detector and has no corresponding trigger in the other detector within the expected coincidence window. The rule is written in XOR form,
\[
\text{Output Y (Veto)}=
\begin{cases}
0, & A=0,\; B=0\\
1, & A=1,\; B=0\\
1, & A=0,\; B=1\\
0, & A=1,\; B=1
\end{cases}
\]
so that exactly one loud detector state activates the veto, whereas coincident loud states are retained as potentially astrophysical [2601.02713].

In Boolean network theory, the same asymmetry appears as a forced-zero logic. A veto function \(f_v\) is defined by disjoint activator and inhibitor sets \(A\) and \(I\), with
\[
f_v(\sigma)=1 \Leftrightarrow \left(\forall j\in I:\sigma_j=0\right)\ \text{and}\ \left(\exists l\in A:\sigma_l=1\right).
\]
Any single inhibitory input can therefore force the output to \(0\), regardless of all activators. This is a stricter form of inhibition than ordinary threshold balancing, and it is representable by weights \(w_j\in\{-k,0,+1\}\) and threshold \(\theta=0\) [1405.3669].

In graph theory, veto is implemented geometrically. A veto interval \(I(a)=(a_l,a_v,a_r)\) is a closed interval with an interior veto mark \(a_v\), and two vertices are adjacent only when the corresponding intervals intersect while neither contains the other’s veto mark. Formally, adjacency holds iff
\[
a_v<b_l<a_r<b_v \quad \text{or} \quad b_v<a_l<b_r<a_v.
\]
This marked-interval rule immediately yields the structural fact that veto interval graphs are triangle-free [1709.09259].

Across these settings, veto is thus not merely exclusion in an informal sense. It is a negative admissibility criterion: a single-detector trigger lacks network support, an inhibitor dominates activators, or an interval overlap is invalidated by a veto mark. This suggests a common interpretation in which veto rules encode decisive counterevidence rather than weak penalty.

## 2. Anticoincidence and auxiliary vetoes in gravitational-wave searches

In transient gravitational-wave searches, vetoes are used to suppress terrestrial noise without discarding plausible astrophysical events. The anticoincidence veto for binary-black-hole matched filtering exploits the fact that genuine transients should be observed coincident in time at geographically separated observatories, whereas local glitches are generally non-coincident. For the LIGO Hanford–Livingston pair, the coincidence window is about \(15\ \mathrm{ms}\), consistent with the intersite light-travel time. The implementation described for the HL network divides coincident data into overlapping stretches of about \(128\ \mathrm{s}\), runs a particle swarm optimization search over BBH parameters using IMRPhenomXAS templates, forms triggers at SNR above about \(4\), reweights them with the power \(\chi^2\)-veto and the sine-Gaussian veto, discards triggers with reweighted-SNR/SNR ratios below unity, often below about \(0.75\), and then applies anticoincidence to triggers louder than about \(6\) in reweighted SNR. Background estimation uses time slides typically around \(50\ \mathrm{ms}\), and vetoed intervals are removed self-consistently from the observed time so that the false-alarm-rate estimation is not biased. In a 30-day O3a demonstration with about \(14.5\) days of coincident time, the veto removed roughly \(30\) minutes of coincident data, brought the background closer to the Gaussian limit, and increased the number of recovered injections at essentially all IFAR thresholds, with the gain strongest for moderate-SNR and expected to be especially useful for short-duration transient signals [2601.02713].

A different gravitational-wave use of vetoes relies on auxiliary channels rather than detector-network timing. The Ordered Veto List algorithm constructs veto configurations from an auxiliary channel name, a threshold on auxiliary glitch significance, and a time window around each selected auxiliary glitch. It evaluates each configuration by efficiency,
\[
\varepsilon = \frac{n_c}{N_{GW}},
\]
fractional dead-time,
\[
f = \frac{t}{T},
\]
and the ratio \(\varepsilon/f\), together with a Poisson significance for the observed number of coincidences. Configurations are ordered by \(\varepsilon/f\) and applied hierarchically so that removed glitches and dead-time are excluded from later steps. In the reported LIGO studies, time windows \(\{25,50,100,150,200\}\,\mathrm{ms}\) and Kleine-Welle significance thresholds \(\{15,25,30,50,100,200,400,800,1600\}\) were used. Earlier applications rejected \(13\)–\(45\%\) of single-detector glitches and \(5\)–\(10\%\) of coincident background with under \(1\%\) dead-time, and the later S4 and S6 studies showed that most performance was achieved after about two iterations while the ordered configuration list compressed strongly by iteration \(9\) [1303.7159].

For continuous-wave searches, the veto problem is not transient coincidence but astrophysical phase consistency. The DM-off veto compares the significance of a standard Doppler-modulated search against a search in which the Doppler modulation is turned off while amplitude modulation is retained. The veto is tuned on \(1500\) fake-signal injections so that none are rejected, giving a false dismissal rate less than \(1\) in \(1500\), i.e. \(<0.07\%\). The threshold is
\[
2F^\mathrm{thr}_\mathrm{DM-off} =
\begin{cases}
62 & F \le 400,\\
10^{0.9\log(F - 0.5)} & F > 400,
\end{cases}
\]
and a candidate is rejected if the DM-off statistic exceeds that threshold. Applied to the \(6349\) candidates from the Einstein@Home O1 low-frequency all-sky search, the veto classified \(6345\) as coherent disturbances, i.e. \(>99.9\%\), leaving four survivors after the full three-step hierarchy [1707.05268].

These gravitational-wave implementations differ in mechanism but share a network-consistency principle. Anticoincidence vetoes reject loud isolated triggers, OVL rejects intervals of livetime supported by auxiliary-channel correlations, and DM-off rejects candidates that are better explained by terrestrial coherence than by astrophysical Doppler structure.

## 3. Active veto detectors in rare-event and intensity-frontier experiments

In detector physics, veto commonly denotes an active subsystem that tags backgrounds which would otherwise mimic the target process. The underlying logic is anticoincidence rather than statistical down-ranking: if the shielding, scintillator, or auxiliary calorimeter sees a signature characteristic of a background process, the primary event is rejected.

For cosmogenic-spallation rejection in large liquid scintillator, the veto problem is dominated by \({}^9\)Li and \({}^8\)He backgrounds that can mimic inverse beta decay. In a \(20\) kton detector such as JUNO, with total muon rate \(\sim 5.4\) Hz, KamLAND-style aggressive vetoes are too costly. The optimized strategy is a two-component veto: a cylindrical veto for tracked muons and a full-detector veto for poorly tracked showering muons. With perfect tracking, the optimal hierarchy configuration uses \(E_c \approx 2.9\) GeV, \(t_c \approx 1.1\) s, and \(r_c \approx 2.3\) m, giving \(90\%\) cylindrical veto efficiency and \(97\%\) live time, while \(\Delta\chi^2\) falls from \(13.8\) to \(12.4\). For \(\theta_{12}\), the optimal cylindrical veto efficiency is \(93\%\), with \(E_c \approx 2.4\) GeV, \(t_c \approx 1.2\) s, \(r_c \approx 2.5\) m, \(94\%\) live time, and \(\sigma(\theta_{12})/\theta_{12} \approx 0.45\%\) compared with \(\sim 0.44\%\) with no background. The paper’s central point is that the optimal veto is surprisingly loose, because additional rejection rapidly costs live time while the unrejected background can still be constrained and subtracted [1505.05609].

Several experiments implement hardware vetoes as dedicated detector upgrades. In NA64, a prototype veto hadron calorimeter built from \(30\) layers of \(25\) mm copper interleaved with \(29\) layers of \(2\) mm scintillator was installed downstream to intercept large-angle hadrons and photon-nuclear secondaries escaping the main acceptance. With \(4.4\times10^{11}\) electrons on target, it rejected the upstream-electroproduction background by more than an order of magnitude and enabled the missing-energy threshold to be reduced from \(50\) GeV to \(40\) GeV, with a detailed data-driven background estimate of
\[
n_b = \left(1.1 \pm 1.4\,(\mathrm{stat}) \pm 2.4\,(\mathrm{sys})\right)\times 10^{-2}
\]
for \(1.232\times10^{11}\) EOT [2503.11275]. In the CROSS \(0\nu\beta\beta\) program, a nine-sector muon veto surrounding the cryogenic setup uses either \(M_V>1\) or \(M_V>0\) trigger logic; combined with the multiplicity cut of thermal detectors, the two-sector and single-sector logics reject \(99.2\%\) and \(99.7\%\) of muon-induced events in the ROI, respectively. The adopted single-sector strategy incurs dead time of about \(18\%\) but reduces the ROI background to \(\sim 2\times 10^{-3}\ \mathrm{cnts}/\mathrm{keV}/\mathrm{kg}/\mathrm{yr}\) [2510.27406]. In the GeSparK HPGe+LS coincidence detector, an upgraded six-panel plastic-scintillator veto with four panels placed between the copper and lead layers achieved a measured \(92.69(3)\%\) background reduction over \(20\)–\(3000\) keV and \(98.87(1)\%\) reduction for saturated HPGe events above \(3000\) keV, compared with a Monte Carlo expectation of \(99.4(1)\%\) veto efficiency [2502.11734]. At miniICAL, the CMVD based on extruded plastic scintillators, wavelength-shifting fibers, and SiPMs is designed for efficiency better than \(99.99\%\) with false-positive rate below \(10^{-5}\); simulation with a \(2.5\) p.e. threshold, at least two SiPMs above threshold per strip, and a \(30\) cm matching window supports the required \(>99.99\%\) veto efficiency with negligible fake rate [2403.06114].

Dark-matter searches provide a more elaborate use of veto subsystems because the backgrounds of concern are neutron-like and hence WIMP-like in the primary detector. The ZEPLIN-III anti-coincidence detector combined \(52\) plastic scintillator bars with gadolinium-loaded polypropylene to tag neutron captures. Design studies predicted rejection of over \(65\%\) of neutron events satisfying WIMP selection, a reduction of the background in the WIMP region from \(\simeq 0.4\) to \(\simeq 0.14\) events yr\(^{-1}\), and gamma tagging above \(15\%\) [1004.4207]. Operational data then measured near-unity live time relative to ZEPLIN-III, prompt gamma tagging of \(28.1\pm 0.2\%\), total neutron tagging of \(60.5\pm 0.5\%\), prompt and delayed accidental rates of \(0.4\%\) and \(0.7\%\), and an inferred residual neutron background of \(\sim 0.2\) events per year in the WIMP acceptance region [1103.0393]. A conceptual boron-loaded liquid-scintillator neutron veto pushed the same logic further: a \(1\) m thick veto based on \(50\%\) w/w tri-methyl borate in pseudocumene shortened the neutron capture time from about \(253\ \mu\mathrm{s}\) in pure pseudocumene to \(2.3\ \mu\mathrm{s}\), yielded internal radiogenic-neutron veto efficiency of \(99.78 \pm 0.01\%\), maintained better than \(99.7\%\) efficiency with a \(60\ \mu\mathrm{s}\) window after inner-detector capture and feed-through effects, and reduced cosmogenic-neutron recoil events by about a factor of \(40\) for a \(1\) m veto [1010.3609].

These implementations make clear that detector vetoes are not merely ancillary hardware. They are exposure-defining systems whose optimization is governed by the same trade-off that appears in software vetoes: rejection efficiency versus dead time, acceptance loss, or live-time cost.

## 4. Jet vetoes in collider phenomenology and measurements

In collider physics, a veto suppresses events with additional hadronic activity beyond a prescribed scale. The operational object is usually a jet veto survival probability or gap fraction, and the theoretical challenge is that the veto introduces logarithmic sensitivity to soft and collinear radiation.

For dileptonic \(t\bar t\) production at \(7\) TeV, the ATLAS measurement defined the gap fraction
\[
f(Q_0)=\frac{n(Q_0)}{N}=\frac{\sigma(Q_0)}{\sigma},
\]
where \(n(Q_0)\) counts selected events containing no additional jet above threshold \(Q_0\) in the veto region. Additional jets were reconstructed with anti-\(k_t\), \(R=0.4\), required to satisfy \(p_{\mathrm T}>25~\mathrm{GeV}\) and \(|y|<2.4\), and were studied in the rapidity intervals \(|y|<0.8\), \(0.8\le |y|<1.5\), \(1.5\le |y|<2.1\), and \(|y|<2.1\). An alternate observable vetoed on the scalar transverse momentum sum of the additional jets. After multiplicative detector corrections \(C(x)=f^{\rm truth}(x)/f^{\rm reco}(x)\), typically about \(2\)–\(5\%\) at \(Q_0=25\) GeV, the data were compared with MC@NLO, POWHEG, ALPGEN, and SHERPA. The full interval \(|y|<2.1\) was described reasonably overall, but in the most central interval \(|y|<0.8\) POWHEG predicted a gap fraction that was too large, while in the most forward interval \(1.5\le |y|<2.1\) none of the generators agreed over the full threshold range [1203.5015].

For dijet production, ATLAS measured the fraction of events surviving a veto on any additional jet with \(p_T>20\) GeV in the rapidity interval bounded by the two boundary jets. Jets were reconstructed with anti-\(k_t\), \(R=0.6\), required to satisfy \(p_T>20\) GeV and \(|y|<4.4\), and the measurements were presented as functions of \(\Delta y\) up to about \(6\) units and \(50<\overline{p}_T<500\) GeV. The gap fraction decreased with increasing \(\Delta y\) and generally with increasing \(\overline{p}_T\), while the mean number of jets in the gap increased with both variables. Among the generators studied, POWHEG plus parton shower gave the best overall description in many regions, HEJ described the large-\(\Delta y\), low-\(\overline{p}_T/Q_0\) regime well, and ALPGEN showed the largest discrepancies [1107.1641].

The theoretical status of jet vetoes depends strongly on the observable definition. Inclusive vetoes such as
\[
E_T = \sum_m p_{Tm},
\qquad
T_B = \sum_m p_{Tm}\,e^{-|y_m-Y|}
\]
are global and can, in principle, be resummed to higher orders. Jet-based exclusive vetoes,
\[
T_j = \max_{m\in j(R)} p_{Tm},
\qquad
T_{Bj} = \max_{m\in j(R)} p_{Tm}\,e^{-|y_m-Y|},
\]
depend on the jet algorithm and on the jet radius \(R\). For \(R\sim 1\), soft-collinear mixing generates \(O(1)\) terms starting at NNLL, such as \(\alpha_s^2 R^2 \ln\lambda\), that are not reproduced automatically by standard soft-collinear factorization. For \(R\ll 1\), clustering induces \(\ln R\) terms, with structures of the form
\[
\alpha_s^n\, f^{(n)}_{\rm alg}(R)\,\ln\lambda,
\qquad
f^{(n)}_{\rm alg}(R)\supset \ln^k R,\quad k\le n-1,
\]
which contribute at NLL in the exponent and cannot be resummed with the currently available methods. The two-loop coefficients \(C_T^{(2)}(\ln R)\) and \(C_{p_T}^{(2)}(\ln R)\) were computed explicitly, and for the \(R=0.4\) and \(R=0.5\) values relevant to ATLAS and CMS Higgs analyses the clustering logarithms are numerically important [1206.4312].

In collider usage, therefore, veto is simultaneously an analysis cut and a precision-theory object. It defines exclusive categories experimentally, but also reorganizes perturbation theory by converting unrestricted QCD radiation into logarithmically sensitive no-emission probabilities.

## 5. Veto power, voting rules, and delegation mechanisms

In social-choice theory, veto power is the dual of majority power. For quota \(q\) and number \(l\) of least-preferred candidates, a rule satisfies the \((q,l)\)-veto criterion iff it satisfies the \((q,m-l,m)\)-majority criterion for each \(m\). Veto power is measured by the minimal share of voters needed to guarantee that each of their \(l\) least-preferred candidates loses. The paper gives exact worst-case quotas for major rules: instant-runoff voting has threshold \(q=0.500\) for \(l=1,2,3,4\) and in fact for all \(l\); plurality has \(q=1.000\) for all \(l\); plurality with runoff has \(q=0.500\) for \(l=1\) but \(q=1.000\) for \(l\ge 2\); Borda has \(q=0.500\) for \(l=1\), \(0.667\) for \(l=2\), \(0.750\) for \(l=3\), \(0.800\) for \(l=4\), and \(q=l/(l+1)\) in the unrestricted table; Black’s rule and proportional veto core are identified as minority-protective exceptions with relatively low majority power but high veto power [1811.06739].

A different voting-theoretic meaning of veto appears in metric distortion. PluralityVeto initializes each candidate with plurality score
\[
plu(c)=|\{v\in V : top(v)=c\}|,
\]
then runs an \(n\)-round process in which voter \(v_i\) vetoes her bottom choice among the candidates whose current score is still positive,
\[
A_i=\{c\in C : score(c)>0\},\qquad c_i = bottom_{A_i}(v_i),
\]
and decrements that score by one until the last standing candidate wins. The rule uses only two queries per voter, a top query and a bottom-among query, yet achieves distortion \(3\), which is the optimal deterministic metric-distortion bound. Its randomized \(k\)-round extension, RoundPluralityVeto\(_k\), chooses the winner with probability proportional to residual score after \(k<n\) veto rounds and also has distortion at most \(3\) for all \(k\) [2206.07098].

In economic mechanism design, veto denotes the principal’s power to retain the status quo rather than randomizing among non-status quo alternatives. When the principal is more risk-averse than the agent toward non-status quo options and the agent has state-independent preferences, an optimal direct mechanism is only if it is a veto mechanism:
\[
m(\theta)=p(\theta)\circ a_0,\; (1-p(\theta))\circ a(\theta).
\]
The principal randomizes only between the status quo \(a_0\) and a single non-status quo action. In the one-dimensional quadratic formulation, the key function is
\[
\eta(\theta)\equiv \sqrt{(\theta-v_0)^2+u_0}+v_0,
\]
and in the valuable-veto case the optimal mechanism pools below a threshold \(\bar\theta\) and uses veto only when the state exceeds that threshold, with
\[
a^*(\theta)=
\begin{cases}
\bar a, & \theta<\bar\theta,\\
\eta(\theta), & \theta\ge \bar\theta,
\end{cases}
\qquad
p^*(\theta)=
\begin{cases}
0, & \theta<\bar\theta,\\
\frac{\eta(\theta)-\bar a}{\eta(\theta)-v_0}, & \theta\ge\bar\theta.
\end{cases}
\]
The status quo functions as a punishment device that keeps the agent indifferent across reports [2208.14829].

Veto bargaining studies a related but distinct environment in which a proposer offers a delegation set to a veto player who can accept an action or veto to the status quo \(0\). Full delegation is the interval \([0,1]\), no compromise is the singleton offer of the proposer’s ideal action \(1\), and the intermediate mechanism is interval delegation \([c,1]\). Under logconcavity of the type density in the linear-quadratic class, interval delegation is optimal, and full delegation is optimal if \(f\) is decreasing on \([0,1]\). The expected payoff of interval delegation is
\[
W(c):=u(0)F(c/2)+u(c)(F(c)-F(c/2))+\int_{c}^{1}u(v) f(v)\,dv+u(1)(1-F(1)),
\]
with first-order condition
\[
2u'(c^*)\left[F(c^*)-F(c^*/2)\right]-f(c^*/2)\left[u(c^*)-u(0)\right]=0.
\]
Here veto is not merely a blocking right; it is the status-quo fallback around which the whole optimal menu is organized [2006.06773].

Taken together, these results show that veto in collective choice has two analytically distinct forms. One is a protection against disliked outcomes, quantified by minimal coalition thresholds. The other is a procedural device that disciplines proposals or candidates through the ever-present possibility of exclusion.

## 6. Veto structures in Boolean dynamics and graph theory

In Boolean dynamics, veto functions form a specific class of update rules intended to capture absolute inhibition in regulatory and signaling systems. For a \(k\)-ary veto function with \(m\) inhibitors and \(k-m\) activators, the activity of an inhibitor is
\[
\alpha_l(f)=\frac{2(2^{k-m}-1)}{2^k},
\]
the activity of an activator is
\[
\alpha_l(f)=\frac{2}{2^k},
\]
and the total sensitivity is
\[
s(f)=\frac{m(2^{k-m}-2)+k}{2^{k-1}}.
\]
Within the annealed approximation, \(s<1\), \(s=1\), and \(s>1\) correspond to ordered, critical, and chaotic dynamics. The ensemble-averaged sensitivity for random inhibitor probability \(\gamma\) has a closed form, and the paper emphasizes that the ensemble average never exceeds \(1\), so random veto-function networks are typically ordered. Empirically, veto functions are at least as over-represented as threshold functions and more over-represented than canalyzing functions in the Helikar et al. intracellular signaling network for arities \(k\le 5\), and yeast cell-cycle dynamics can be formulated with none or minimal changes to the wiring diagrams [1405.3669].

In graph theory, veto interval graphs reinterpret the marked-point logic geometrically. Besides the basic adjacency rule, the theory establishes that any VI representation can be perturbed so that all veto marks are distinct, that \(I(a)\subseteq I(b)\) implies \(ab\notin E(G)\), and that complete bipartite graphs \(K_{m,n}\), cycles \(C_n\) for \(n\ge 4\), and trees are VI graphs. The family also has nontrivial exclusions: \(G_{10}\) is not a VI graph, and the Grötzsch graph is a minimal forbidden induced subgraph. For subclasses, the paper proves
\[
G \text{ is a PVI graph } \iff G \text{ is a UVI graph.}
\]
It also shows that UVI graphs are \(4\)-colorable, that the chromatic number of a VI graph can be at least \(4\) via \(\Circ(13,\{1,5\})\), and that the exact maximum chromatic number of general VI graphs remains open [1709.09259].

These abstract theories make explicit something that the experimental uses of veto often leave implicit: veto is a structural asymmetry. In Boolean networks, inhibition is lexicographically stronger than activation. In veto interval graphs, overlap is subordinate to marked-point exclusion. A plausible implication is that veto-based formalisms are especially useful when a system is organized around decisive negative constraints rather than smooth trade-offs.

## 7. Common trade-offs and recurring limitations

Across the literature, veto design is governed by a repeated optimization problem: maximize rejection of undesirable outcomes while minimizing collateral loss of useful ones. In gravitational-wave transient searches, the anticoincidence veto removes only a small amount of coincident time yet substantially suppresses the non-Gaussian background tail, while OVL explicitly ranks vetoes by efficiency over dead-time and uses Poisson significance to guard against over-training [2601.02713] [1303.7159]. In large liquid scintillator neutrino detectors, the optimal veto is not the most aggressive one because dead time quickly degrades hierarchy sensitivity and only slightly affects \(\theta_{12}\), whose uncertainty is dominated by reactor-spectrum systematics [1505.05609]. In CROSS, the adopted \(M_V>0\) logic attains stronger rejection but at the cost of \(\sim 18\%\) dead time [2510.27406]. In ZEPLIN-III and boron-loaded scintillator proposals, capture-enhanced vetoes are optimized to reject neutron-like backgrounds without introducing additional radioactivity or unmanageable accidentals [1103.0393] [1010.3609].

Collider jet vetoes exhibit an analogous theoretical trade-off. Large \(R\) mitigates \(\ln R\) clustering logarithms but makes soft-collinear mixing a leading-power issue beyond NLL; small \(R\) restores factorization at leading power but introduces clustering logarithms that are not presently resumable with available methods [1206.4312]. In voting and delegation, stronger veto protection for minorities or veto players can also weaken the power of majorities or proposers, with the literature identifying both high-veto-power rules such as IRV and minority-protective exceptions such as Borda and Black’s rule [1811.06739].

The most persistent misconception is that veto is synonymous with maximal rejection. The experimental and formal results do not support that view. The optimal veto can be loose, localized, delayed, probabilistic, or thresholded, and in several domains its value lies as much in background characterization and credible inference as in brute-force exclusion.

Source: https://www.emergentmind.com/topics/veto