---
title: Plurality Veto Voting Rule
url: https://www.emergentmind.com/topics/plurality-veto
type: topic
---

# Plurality Veto Voting Rule

Plurality Veto is a single-winner voting rule in ordinal metric social choice in which each candidate begins with support equal to its plurality score, voters then successively veto their least-preferred currently standing candidate, and the last standing candidate is elected. Its central significance is that, despite using only ordinal information, it achieves the optimal deterministic metric distortion of \(3\), matching the known lower bound for all deterministic rules. Subsequent work reinterprets it as the uniform-voter, plurality-weighted special case of a generalized \((p,q)\)-veto core, develops anonymous and neutral continuous-time variants, and uses the same structure to obtain learning-augmented and minority-protection generalizations [2206.07098].

## 1. Metric formulation and objective

In the metric distortion framework, there is a finite set of candidates \(C\) and a finite set of voters \(V\), with \(|C|=m\) and \(|V|=n\). Voters and candidates are embedded in a common metric space \((X,d)\), where
\[
d : (V \cup C) \times (V \cup C) \to \mathbb{R}_{\ge 0}.
\]
For a candidate \(c \in C\), the social cost is
\[
SC(c,d) = \sum_{v \in V} d(v,c).
\]
The optimal candidate is
\[
c^*(d) = \arg\min_{c \in C} SC(c,d).
\]

The voting rule does not observe the distances \(d(v,c)\); it only receives the ordinal profile \(\sigma = (\sigma_v)_{v\in V}\), where each ranking is induced by distance:
\[
\sigma_v(c_1) < \sigma_v(c_2) \Rightarrow d(v,c_1) \le d(v,c_2).
\]
A metric \(d\) is aligned with \(\sigma\), written \(d \triangleright \sigma\), when every voter’s ranking is consistent with \(d\). For a deterministic rule \(ALG\), distortion is
\[
\mathrm{distortion}(ALG)=\sup_{\sigma}\;\sup_{d:\,d\triangleright \sigma}\frac{SC(ALG(\sigma),d)}{SC(c^*(d),d)}.
\]
No deterministic rule can achieve distortion better than \(3\), and there exist rules that achieve \(3\) exactly [2307.07495].

## 2. Rule definition and operational structure

Plurality Veto begins from plurality support and then applies veto pressure. For each candidate \(c\), let
\[
\mathrm{plu}(c)=|\{v\in V: c=\mathrm{top}(v)\}|
\]
denote the plurality score. The rule initializes
\[
\mathrm{score}(c)=\mathrm{plu}(c).
\]

Fix an arbitrary order of voters \((v_1,\dots,v_n)\). At round \(i\), let
\[
A_i=\{c\in C:\mathrm{score}(c)>0\}
\]
be the set of standing candidates. Voter \(v_i\) identifies her bottom candidate among \(A_i\),
\[
c_i=\mathrm{bottom}_{A_i}(v_i),
\]
and decrements that candidate’s score by \(1\). After \(n\) rounds, the rule returns \(c_n\), the candidate vetoed in the last round. Equivalently, candidates start with as many “lives” as first-place votes, every voter removes one life from her least-preferred surviving candidate, and the last standing candidate wins [2206.07098].

This formulation is notable for its low communication overhead: it only makes two queries to each voter, namely a top query and a bottom-among query on the current active set. At the same time, the original sequential rule depends on the order in which voters are processed, so the winner can vary with that order; later work identifies this order dependence as the source of non-anonymity and motivates simultaneous variants [2206.07098].

## 3. Veto-core interpretation and simultaneous variants

Later work reframed Plurality Veto through a generalized veto core. Let \(p\in\Delta(V)\) be a distribution over voters and \(q\in\Delta(C)\) a distribution over candidates. A coalition \(T\subseteq V\) \((p,q)\)-blocks a candidate \(c\) if there exists \(B\subseteq C\) such that \(B \succ_T c\) and
\[
p(T) > 1-q(B).
\]
The \((p,q)\)-veto core is the set of candidates not \((p,q)\)-blocked by any coalition. The same work proves that a candidate is in the \((p,q)\)-veto core if and only if it is \((p,q)\)-dominant, meaning that it admits a \((p,q)\)-matching in the associated domination graph. Under uniform voter weights and candidate weights proportional to plurality scores, Plurality Veto is exactly the plurality-weighted special case of this framework [2305.19632].

This reinterpretation yields two structural consequences. First, previous procedures for selecting winners from veto cores can be viewed as matching algorithms, and different election methods realize different matchings. Second, a continuous-time rule, SimultaneousVeto, replaces sequential vetoing by a process in which every voter continuously brings down, at rate \(1\), the support of her bottom choice among not-yet-eliminated candidates. In the plurality specialization, each candidate starts with public support equal to its plurality score, and a candidate is eliminated if it is opposed by a voter after its support reaches \(0\). The resulting SimultaneousPluralityVeto is anonymous and neutral, returns a nonempty set of tied winners, and satisfies resolvability, monotonicity, majority, majority loser, mutual majority, and reversal symmetry [2305.19632].

The generalized-veto-core perspective therefore places the original rule, its simultaneous version, and the earlier matching-based distortion rules in a common cooperative and combinatorial framework.

## 4. Distortion guarantees, randomized interpolation, and learning augmentation

The original distortion proof proceeds by showing that the Plurality Veto winner has a perfect matching in an appropriate domination graph, which implies distortion \(3\). The same paper also defines a randomized family, RoundPluralityVeto\((k)\), in which the veto process is run for only \(k<n\) rounds and then a candidate is chosen with probability proportional to its residual score. This interpolates between Random Dictatorship at \(k=0\) and Plurality Veto at \(k=n-1\), and for all \(k\) the rule has distortion at most \(3\) [2206.07098].

A later learning-augmented formulation modifies the plurality-weighted veto-core process using a prediction \(p\) of the optimal candidate and a parameter \(\delta\in[0,1)\). For all \(c\neq p\),
\[
\mathsf{score}(c)=\mathrm{plu}(c),
\]
while for the predicted candidate
\[
\mathsf{score}(p)=\mathrm{plu}(p)+b,\qquad b=\frac{2\delta n}{1-\delta}.
\]
Every voter down-votes her least-preferred active candidate at rate
\[
\frac{1+\delta}{1-\delta}.
\]
This algorithm, BoostedSV, achieves
\[
\mathsf{consistency}=\frac{3-\delta}{1+\delta},
\qquad
\mathsf{robustness}=\frac{3+\delta}{1-\delta},
\]
and this robustness–consistency trade-off is optimal among deterministic algorithms. When \(\delta=0\), the guarantees collapse to distortion \(3\), recovering the unboosted plurality-veto baseline. The error-sensitive bound is
\[
\min\left\{
\frac{3-\delta+2\delta\eta}{1+\delta},
\frac{3+\delta}{1-\delta}
\right\},
\qquad
\eta=\frac{n\cdot d(p,c^*)}{SC(c^*)}.
\]
As \(\delta\to 1\), consistency tends to \(2\) while robustness tends to \(\infty\) [2307.07495].

| Variant | Modification | Guarantee |
|---|---|---|
| Plurality Veto | Full veto process; last standing candidate wins | Distortion \(3\) |
| RoundPluralityVeto\((k)\) | Run only \(k<n\) veto rounds, then sample by residual score | Distortion at most \(3\) for all \(k\) |
| BoostedSV | Add prediction-dependent boost and scaled veto rate | Optimal robustness–consistency trade-off |

These extensions preserve the core intuition of plurality-weighted support depleted by bottom-directed vetoes, while altering how much the rule relies on veto dynamics, randomness, or side information.

## 5. Position inside the \(k\)-Approval Veto spectrum

Recent work embeds Plurality Veto into a broader family called \(k\)-Approval Veto. In that family, each candidate starts with its \(k\)-approval score, each voter appears exactly \(k\) times in a veto order, and at each step the voter decrements the score of her least-preferred currently eligible candidate. The \(k\)-approval veto core is the set of all candidates that can survive for some veto order. The case \(k=1\) is exactly Plurality Veto, except that the newer formulation allows ties, whereas the original rule immediately eliminates all candidates whose score reaches \(0\) and insists on picking a single winner [2507.17981].

The utilitarian distortion theorem for the full class states that every candidate in the \(k\)-approval veto core has distortion at most
\[
2\min(k+1,m)-1.
\]
Specializing to \(k=1\) yields the familiar bound \(3\), which is tight. For the \(\alpha\)-percentile objective, every candidate in the \(k\)-approval veto core has distortion at most \(5\) for
\[
\alpha \ge \frac{k}{k+1},
\]
and the distortion is unbounded for
\[
\alpha < \frac{k}{k+1}.
\]
Thus, for Plurality Veto, the threshold is \(\alpha \ge 1/2\): every winner has \(\alpha\)-percentile distortion at most \(5\) for \(\alpha\in[1/2,1)\), and no deterministic rule can guarantee less than \(5\) on that interval. For the egalitarian objective, every candidate in the \(k\)-approval veto core has distortion at most \(3\), so the \(k=1\) case is again optimal [2507.17981].

The same paper studies mutual minority protection. In general, every candidate in the \(k\)-approval veto core has mutual minority protection at least \(k\). For \(k=1\), the nontrivial guarantee is stronger than the generic statement: every Plurality Veto winner has mutual minority protection at least \(2\), because candidates ranked last by strictly more than \(n/2\) voters cannot possibly win under PluralityVeto. In that sense, Plurality Veto satisfies the majority loser criterion but remains the welfare-maximizing and minority-protection-minimizing endpoint of the \(k\)-Approval Veto spectrum, while \(k=m\) yields VoteByVeto and the proportional veto core [2507.17981].

## 6. Connections to \(\beta\)-plurality and proportional clustering

Plurality Veto also appears in geometric clustering and proportional-fairness work. A point \(p\) is a \(\beta\)-plurality point if
\[
\left|\{i\in N : \beta\cdot d(i,p)\le d(i,q)\}\right|
\ge \frac{|N|}{2}
\qquad\text{for all } q\in \mathcal X.
\]
For \(\beta=1\), this becomes the metric Condorcet-point condition. The \(\beta\)-plurality problem asks for a point with the largest possible \(\beta\) [2502.10068].

Plurality Veto always selects a
\[
(\sqrt{5}-2)
\]
-plurality point. Since \(1/(\sqrt{5}-2)=2+\sqrt{5}\), this yields a \((2+\sqrt{5})\)-Droop proportional \(1\)-center. The same paper proves that a point \(p\) is a \(\beta\)-plurality point if and only if the clustering \(\{p\}\) satisfies \(\frac{1}{\beta}\)-Droop proportionality, so the Plurality Veto guarantee translates directly into a proportional-clustering guarantee [2502.10068].

A generic theorem in that setting states that every \(\beta\)-plurality point has distortion
\[
2\frac{1}{\beta}+1.
\]
Substituting \(\beta=\sqrt{5}-2\) gives \(5+2\sqrt{5}\), which is weaker than the known distortion-\(3\) guarantee for Plurality Veto itself. This juxtaposition is informative rather than contradictory: it shows that the rule simultaneously satisfies a strong metric-distortion bound and a certified plurality/proportionality guarantee, and it enabled the proof that \((2+\sqrt{5})\)-proportionally fair clusterings can be found using purely ordinal information [2502.10068].

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