Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1711.05092

How long is a piece of string? An exploration of multi-winner approval voting and ballot-length restrictions

Barton E. Lee
View original source ↗Read source document ↗Export metadata ↓

Abstract

Multi-winner approval elections are seen in a variety of settings ranging from academic societies and associations to public elections. In such elections, it is often the case that ballot-length restrictions are enforced; that is, where voters have a limit on the number of candidates which they can vote for. Despite this common feature, there does not seem to be any theoretical justification for ballot-length restrictions (Laslier and Van der Straeten, 2016). This work endogenously derives the set of voter best-response ballot lengths under complete information and with general assumptions on voter utilities and voting rules. These results provide justification for some ballot-length restrictions observed in practice, however when considering equilibrium outcomes our analysis shows that this justification is no longer valid. Equilibrium analysis is considered for voters with lazy and truth-bias second-order tendencies and the equilibrium solution concept is pure-Nash equilibria. The key insights show that ballot-length restrictions or institutional features which make voting costly may lead to instability in election outcomes when voters have diverse preferences, via the non-existence of equilibria. On the other hand, when equilibria do exist they satisfy desirable properties which are not guaranteed by equilibria attained under costless voting and in the absence of ballot-length restrictions. In summary our results highlight a stark trade-off between stable and desirable election outcomes.

Explore related subjects

cs.GTcs.MA

Keep this discovery

BibTeXRIS

Barton E. Lee. 2017-11-14. How long is a piece of string? An exploration of multi-winner approval voting and ballot-length restrictions. https://arxiv.org/abs/1711.05092

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↗