The Geometry of Coalition Power: Majorization, Lattices, and Displacement in Multiwinner Elections

Qian Guo; Yidan Hu; Rui Zhang

Home/Archive/arXiv

arXiv · 2601.16723

The Geometry of Coalition Power: Majorization, Lattices, and Displacement in Multiwinner Elections

Qian Guo·Yidan Hu·Rui Zhang

View original source ↗Read source document ↗Export metadata ↓

Abstract

How much influence can a coordinated coalition exert in a multiwinner Top-$k$ election under a positional scoring rule? We study the maximum displacement problem: with coalition size $m$, how many of the current top-$k$ winners can be forced out? We show coalition power decomposes into two independent prefix-majorization constraints, capturing how much the coalition can (i) boost outsiders and (ii) suppress weak winners. For arbitrary scoring rules these prefix inequalities are tight, efficiently checkable necessary conditions (exact in the continuous relaxation). For common-step arithmetic-progression (AP) score ladders, including Borda, truncated Borda, $k$-approval/$k$-veto, plurality, and multi-level rules such as $3$--$2$--$1$, we prove a Majorization--Lattice Theorem: feasible aggregate score vectors are exactly the integer points satisfying the Block--HLP prefix-sum capacity constraints plus a single global congruence condition modulo the step size $g$. For Borda ($g=1$) the congruence vanishes, yielding a pure prefix-majorization test. This characterization yields an $O(k'\log k')$ exact feasibility oracle for displacing $k'$ winners, and an $O(k(\log k)^2\log(mx))$ algorithm (via dual-envelope binary search) for computing the maximum achievable displacement $k^\ast$. Experiments on Mallows profiles and PrefLib elections confirm exact cutoffs, diminishing returns, and substantial gains over baseline heuristics; for $g>1$ they also demonstrate the predicted congruence effect, where prefix-only tests produce false positives. The oracle scales to extreme instances, processing $10^9$ candidates in under 28 seconds (memory permitting).

Explore related subjects

cs.GT cs.DS

Keep this discovery

BibTeX RIS

Qian Guo, Yidan Hu, Rui Zhang. 2026-01-23. The Geometry of Coalition Power: Majorization, Lattices, and Displacement in Multiwinner Elections. https://arxiv.org/abs/2601.16723

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↗