English
Related papers

Related papers: Comparing Election Methods Where Each Voter Ranks …

200 papers

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

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…

Computer Science and Game Theory · Computer Science 2017-11-15 Barton E. Lee

It is common that a jury must grade a set of candidates in a cardinal scale such as {1,2,3,4,5} or an ordinal scale such as {Great, Good, Average, Bad }. When the number of candidates is very large such as hotels (BOOKING), restaurants…

Computer Science and Game Theory · Computer Science 2023-02-24 Rida Laraki , Estelle Varloot

Scoring rules are widely used to rank athletes in sports and candidates in elections. Each position in each individual ranking is worth a certain number of points; the total sum of points determines the aggregate ranking. The question is…

Computer Science and Game Theory · Computer Science 2022-09-09 Aleksei Y. Kondratev , Egor Ianovski , Alexander S. Nesterov

Shortlisting of candidates--selecting a group of "best" candidates--is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the perhaps…

Multiagent Systems · Computer Science 2019-08-15 Robert Bredereck , Andrzej Kaczmarczyk , Rolf Niedermeier

To choose a suitable multiwinner voting rule is a hard and ambiguous task. Depending on the context, it varies widely what constitutes the choice of an ``optimal'' subset of alternatives. In this paper, we provide a quantitative analysis of…

Multiagent Systems · Computer Science 2020-09-01 Martin Lackner , Piotr Skowron

Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alternatives (or at least a winning alternative) is produced.…

Computer Science and Game Theory · Computer Science 2014-01-16 Vincent Conitzer

In many real world situations, collective decisions are made using voting. Moreover, scenarios such as committee or board elections require voting rules that return multiple winners. In multi-winner approval voting (AV), an agent may vote…

Computer Science and Game Theory · Computer Science 2019-05-31 Jaelle Scheuerman , Jason L. Harman , Nicholas Mattei , K. Brent Venable

We study the problem of fair sequential decision making given voter preferences. In each round, a decision rule must choose a decision from a set of alternatives where each voter reports which of these alternatives they approve. Instead of…

Computer Science and Game Theory · Computer Science 2025-03-18 Nikhil Chandak , Shashwat Goel , Dominik Peters

We study single-candidate voting embedded in a metric space, where both voters and candidates are points in the space, and the distances between voters and candidates specify the voters' preferences over candidates. In the voting, each…

Computer Science and Game Theory · Computer Science 2019-11-28 Xujin Chen , Minming Li , Chenhao Wang

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…

Multiagent Systems · Computer Science 2020-03-02 Mohammad Ali Javidian , Pooyan Jamshidi , Marco Valtorta , Rasoul Ramezanian

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

In this paper we address the problem of electing a committee among a set of $m$ candidates and on the basis of the preferences of a set of $n$ voters. We consider the approval voting method in which each voter can approve as many candidates…

Optimization and Control · Mathematics 2017-07-31 Diego Ponce , Justo Puerto , Federica Ricca , Andrea Scozzari

This paper considers the ranking problem of candidates for a certain position based on ballot papers filled by voters. We suggest a ranking procedure of alternatives using cooperative game theory methods. For this, it is necessary to…

Computer Science and Game Theory · Computer Science 2022-09-09 Aleksei Kondratev , Vladimir Mazalov

We consider election scenarios with incomplete information, a situation that arises often in practice. There are several models of incomplete information and accordingly, different notions of outcomes of such elections. In one well-studied…

Computer Science and Game Theory · Computer Science 2016-10-27 Palash Dey , Neeldhara Misra

We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…

Computer Science and Game Theory · Computer Science 2023-05-18 Piotr Faliszewski , Andrzej Kaczmarczyk , Krzysztof Sornat , Stanisław Szufa , Tomasz Wąs

The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, wherein the manipulators know the votes of the…

Multiagent Systems · Computer Science 2017-07-14 Palash Dey , Neeldhara Misra , Y. Narahari

We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…

Computer Science and Game Theory · Computer Science 2016-12-01 Pietro Speroni di Fenizio , Daniele A. Gewurz

We characterise multi-candidate pure-strategy equilibria in the Hotelling-Downs spatial election model for the class of best-worst voting rules, in which each voter is endowed with both a positive and a negative vote, i.e., each voter can…

Computer Science and Game Theory · Computer Science 2016-10-11 Dodge Cahan , Arkadii Slinko

We study committee elections from a perspective of finding the most conflicting candidates, that is, candidates that imply the largest amount of conflict, as per voter preferences. By proposing basic axioms to capture this objective, we…

Computer Science and Game Theory · Computer Science 2024-05-10 Théo Delemazure , Łukasz Janeczko , Andrzej Kaczmarczyk , Stanisław Szufa
‹ Prev 1 4 5 6 7 8 10 Next ›