Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.06156

Candidate Resignation Monotonicity in Approval-Based Committee Elections

Yeeseok Oh·Dominik Peters
View original source ↗Read source document ↗Export metadata ↓

Abstract

Approval-based committee (ABC) elections select a fixed-size committee of candidates based on voters' approval preferences. We study a setting where elected members may resign and formalize resignation monotonicity: when we re-run the voting rule after resignations, a resignation monotone rule must still elect all remaining previously winning candidates. We show that many prominent ABC rules fail this property, and by connecting our notion to prior work on ABC elections with dynamic candidate sets, we show that the justified representation (JR) axiom is incompatible with resignation monotonicity. It turns out that fractional committee voting does not suffer from this issue: rules based on using maximum flows in the network representation of an election instance can satisfy both representation axioms and resignation monotonicity. We design an integral version of maximum flow, the Maximum Payment Rule (MPR), and show that it satisfies a relaxed form of resignation monotonicity that only requires there to be some way of replacing the resigning candidates in a way that guarantees the PJR+ axiom. MPR is NP-hard to compute in general, but becomes tractable in structured domains. Finally, we study a strategic setting where a losing candidate may introduce new weak candidates to the election to try to become a winner. We show that all resignation monotone rules as well as many sequential rules are immune, but that the PAV rule can be manipulated in this way.

Explore related subjects

cs.GT

Keep this discovery

BibTeXRIS

Yeeseok Oh, Dominik Peters. 2026-08-06. Candidate Resignation Monotonicity in Approval-Based Committee Elections. https://arxiv.org/abs/2608.06156

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↗