English
Related papers

Related papers: On eligibility by the de Borda voting rules

200 papers

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

Computational Complexity · Computer Science 2010-05-03 Nadja Betzler , Britta Dorn

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial…

Computer Science and Game Theory · Computer Science 2014-01-17 Lirong Xia , Vincent Conitzer

We view voting rules as classifiers that assign a winner (a class) to a profile of voters' preferences (an instance). We propose to apply techniques from formal explainability, most notably abductive and contrastive explanations, to…

Artificial Intelligence · Computer Science 2024-08-27 Clément Contet , Umberto Grandi , Jérôme Mengin

Arrow proved that for three or more candidates, the IIA condition is enough to forbid all non-dictatorial election rules (or Social Welfare Functions). Maskin introduced the weaker MIIA condition, which permits the ``Borda'' election rules…

Combinatorics · Mathematics 2025-11-05 Gabriel Gendler

The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winner by suitably extending all the votes. Betzler and Dorn [1]…

Computational Complexity · Computer Science 2011-11-29 Dorothea Baumeister , Joerg Rothe

Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some candidate of a given party can become the winner of the…

Computer Science and Game Theory · Computer Science 2025-02-06 Ildikó Schlotter , Katarína Cechlárová

The Borda voting rule is a positional scoring rule for $z$ candidates such that in each vote, the first candidate receives $z-1$ points, the second $z-2$ points and so on. The winner in the Borda rule is the candidate with highest total…

Computer Science and Game Theory · Computer Science 2020-10-08 Yiheng Shen , Pingzhong Tang , Yuan Deng

Consider an election where the set of candidates is partitioned into parties, and each party must choose exactly one candidate to nominate for the election held over all nominees. The Necessary President problem asks whether a candidate, if…

Computer Science and Game Theory · Computer Science 2026-02-12 Katarína Cechlárová , Ildikó Schlotter

We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with diversity constraints. Specifically, we assume that the…

Computer Science and Game Theory · Computer Science 2017-11-23 Robert Bredereck , Piotr Faliszewski , Ayumi Igarashi , Martin Lackner , Piotr Skowron

An election is defined as a pair of a set of candidates C=\{c_1,\cdots,c_m\} and a multiset of votes V=\{v_1,\cdots,v_n\}, where each vote is a linear order of the candidates. The Borda election rule is characterized by a vector \langle…

Computational Complexity · Computer Science 2024-05-09 Aizhong Zhou , Fengbo Wang , Jiong Guo

We use Hotelling's spatial model of competition to investigate the position-taking behaviour of political candidates under a class of electoral systems known as scoring rules. In a scoring rule election, voters rank all the candidates…

Computer Science and Game Theory · Computer Science 2013-01-03 Dodge Cahan , John McCabe-Dansted , Arkadii Slinko

We present theoretical and empirical results demonstrating the usefulness of voting rules for participatory democracies. We first give algorithms which efficiently elicit \epsilon-approximations to two prominent voting rules: the Borda rule…

Multiagent Systems · Computer Science 2014-07-17 David Lee , Ashish Goel , Tanja Aitamurto , Helene Landemore

Arrow's celebrated Impossibility Theorem asserts that an election rule, or Social Welfare Function (SWF), between three or more candidates meeting a set of strict criteria cannot exist. Maskin suggests that Arrow's conditions for SWFs are…

Computer Science and Game Theory · Computer Science 2025-11-05 Gabriel Gendler

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

Computer Science and Game Theory · Computer Science 2024-09-30 Daniel Halpern , Safwan Hossain , Jamie Tucker-Foltz

In the context of voting with ranked ballots, an important class of voting rules is the class of margin-based rules (also called pairwise rules). A voting rule is margin-based if whenever two elections generate the same head-to-head margins…

Theoretical Economics · Economics 2026-03-11 Yifeng Ding , Wesley H. Holliday , Eric Pacuit

We prove that there is no preferential voting method satisfying the Condorcet winner and loser criteria, positive involvement (if a candidate $x$ wins in an initial preference profile, then adding a voter who ranks $x$ uniquely first cannot…

Theoretical Economics · Economics 2026-02-20 Wesley H. Holliday

We study positional voting rules when candidates and voters are embedded in a common metric space, and cardinal preferences are naturally given by distances in the metric space. In a positional voting rule, each candidate receives a score…

Computer Science and Game Theory · Computer Science 2017-11-22 Yu Cheng , Shaddin Dughmi , David Kempe

In a party-based election system, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, once the party preferences are declared the outcome of the…

Multiagent Systems · Computer Science 2014-04-10 Jiong Guo , Yash Raj Shrestha , Yongjie Yang

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

We consider spatial voting where candidates are located in the Euclidean $d$-dimensional space, and each voter ranks candidates based on their distance from the voter's ideal point. We explore the case where information about the location…

Computer Science and Game Theory · Computer Science 2024-08-21 Aviram Imber , Jonas Israel , Markus Brill , Hadas Shachnai , Benny Kimelfeld
‹ Prev 1 2 3 10 Next ›