Search arXivSearch

arXiv · 2604.24307

Explanation Systems for Approval-Based Multiwinner Voting

Abstract

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work has focused on the study of binary proportionality axioms that certify whether a given committee is proportionally representative or not. We take a more fine-grained perspective and initiate the study of explanation systems that quantify how a committee represents the electorate, i.e., how much influence each voter exerts, how this influence is allocated across selected candidates, how each candidate is backed by the voters, and why certain candidates were not chosen. Building on the notion of priceability, we propose price systems as a framework for such explanations. A price system assigns each voter an individual budget, which they can spend on selected candidates they approve, and each candidate needs to be purchased at a unit price. Since many price systems can exist for a given outcome, selecting among them requires care. We initiate an axiomatic study of price systems and propose several axioms capturing structural coherence, faithful attribution of influence, and alignment with proportionality. On the algorithmic side, we introduce a polynomial-time computable rule in which voters continuously gain and exercise influence and show that it satisfies all jointly satisfiable axioms. Experiments on synthetic and real-world instances indicate that our explanations correlate with established proportionality notions and can recover unequal influence when it is present.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Niclas Boehmer, Luca Kreisel, Jannik Peters. 2026-04-27. Explanation Systems for Approval-Based Multiwinner Voting. https://arxiv.org/abs/2604.24307

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

KEEP EXPLORING

Related papers

Robust Information Design with Heterogeneous Beliefs in Bayesian Congestion Games

In many engineered systems, agents make decisions under incomplete information, creating opportunities for a planner to influence decentralized behavior through signaling. We study how such signaling can be designed in parallel-network, affine latency congestion games when users may not interpret recommendations using the same beliefs assumed by the planner. To do so, we consider Bayesian congestion games with private recommendations and formulate a robust information design problem in which obedience must hold uniformly over a neighborhood of a nominal prior. This addresses the previously uncharacterized issue of whether obedience itself remains reliable under belief heterogeneity, rather than only under the single prior used at the design stage. We characterize policy-level robustness radii, identify regimes in which the robust obedience region remains nonempty, and analyze the resulting robustness--performance tradeoff through a robust value function whose optimal cost is monotone in the robustness requirement and whose local sensitivity is governed by the active obedience constraints.

cs.GT

Core stability recognition for minimum-cost spanning tree games: Parameterized perspective

Minimum-cost spanning tree game (MSTG) is a cooperative game played on an undirected edge-weighted graph $(G,w)$ representing the network, where each vertex corresponds to a player and each edge has an associated cost~$w$. A distinguished vertex $s \in V(G)$ represents the supply or source. For any coalition of players $S$, the characteristic cost function $c(S)$ is defined as the minimum cost of a spanning tree with respect to $w$, connecting exactly the vertices in $S \cup \{s\}$. In this paper we study the computational complexity of deciding core membership for MSTG. In general, deciding whether a given allocation is in the core is \textsf{coNP}-hard~(Faigle et al.,International Journal of Game Theory,1997). We study the core recognition problem under the name {\sc MSTG Core Non-Membership}. We extend the hardness to graphs which are very close to being planar. On the positive side, we present several algorithmic results within the framework of parameterized complexity. We show that {\sc MSTG Core Non-Membership} is fixed-parameter tractable when parameterized by the support size of the allocation. Turning into structural parameters of graphs, we show that the problem admits an FPT algorithm parameterized by treewidth and signed neighborhood diversity. Last but not least, we investigate kernelization. While in general graphs, under standard complexity-theoretical assumptions, {\sc MSTG Core Non-Membership} does not admit a polynomial kernel parameterized by the vertex cover number, we design a cubic kernel in planar graphs. Furthermore, in general graphs, we obtain quadratic kernel for signed neighborhood diversity and linear kernel for the parameter feedback edge number.

cs.GT

Condorcet-type properties of the linear ordering problem with ties

The Kemeny rule aggregates multiple strict rankings into a single strict ranking that minimizes the sum of its distances from the input rankings. The resulting optimization problem, called the Kemeny problem (\texttt{KP}), is a special case of the linear ordering problem (\texttt{LOP}). The Kemeny rule satisfies several desirable properties in social choice theory, including the extended Condorcet criterion (\texttt{XCC}). Ando et al. strengthened this result by introducing the strong Condorcet criterion (\texttt{SCC}) and showing that it holds for every optimal solution to an arbitrary \texttt{LOP} instance. Yoo and Escobedo extended the Kemeny rule to rankings with ties and showed that the resulting rule satisfies the non-strict extended Condorcet criterion (\texttt{NXCC}). This criterion gives a condition under which one candidate must be ranked strictly above another in every optimal solution. In this paper, we introduce the non-strict strong Condorcet criterion (\texttt{NSCC}), a counterpart of the \texttt{SCC} for rankings with ties, and show that it holds for every optimal solution to an arbitrary instance of the linear ordering problem with ties (\texttt{LOPT}). We also establish a complementary structural property that gives conditions under which two candidates must be tied in every optimal solution to an arbitrary \texttt{LOPT} instance.

cs.GT