Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.00811

Justified Representation: From Hare to Droop

Matthew M. Casey·Edith Elkind
View original source ↗Read source document ↗Export metadata ↓

Abstract

The study of proportionality in multiwinner voting with approval ballots has received much attention in recent years. Typically, proportionality is captured by variants of the Justified Representation axiom, which say that cohesive groups of at least $\ell\cdot\frac{n}{k}$ voters (where $n$ is the total number of voters and $k$ is the desired number of winners) deserve $\ell$ representatives. The quantity $\frac{n}{k}$ is known as the Hare quota in the social choice literature. Another -- more demanding -- choice of quota is the Droop quota, defined as $\lfloor\frac{n}{k+1}\rfloor+1$. This quota is often used in multiwinner voting with ranked ballots: in algorithms such as Single Transferable Voting, and in proportionality axioms, such as Droop's Proportionality Criterion. A few authors have considered it in the context of approval ballots, but the existing analysis is far from comprehensive. The contribution of our work is a systematic study of JR-style axioms (and voting rules that satisfy them) defined using the Droop quota instead of the Hare quota. For each of the standard JR axioms (namely, JR, PJR, EJR, FPJR, FJR, PJR+ and EJR+), we identify a voting rule that satisfies the Droop version of this axiom. In some cases, it suffices to consider known rules (modifying the corresponding Hare proof, sometimes quite substantially), and in other cases it is necessary to modify the rules from prior work. Each axiom is more difficult to satisfy when defined using the Droop quota, so our results expand the frontier of satisfiable proportionality axioms. We complement our theoretical results with an experimental study, showing that for many probabilistic models of voter approvals, Droop JR/EJR+ are considerably more demanding than standard (Hare) JR/EJR+.

Explore related subjects

cs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew M. Casey, Edith Elkind. 2025-08-01. Justified Representation: From Hare to Droop. https://arxiv.org/abs/2508.00811

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗