English
Related papers

Related papers: Propose or Vote: A Canonical Democratic Procedure

200 papers

Liquid democracy with ranked delegations is a novel voting scheme that unites the practicability of representative democracy with the idealistic appeal of direct democracy: Every voter decides between casting their vote on a question at…

Computer Science and Game Theory · Computer Science 2024-03-07 Markus Utke , Ulrike Schmidt-Kraepelin

Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion.…

Data Structures and Algorithms · Computer Science 2016-11-02 Colin Cooper , Robert Elsässer , Tomasz Radzik

Are there voting methods which (i) give everyone, including minorities, an equal share of effective power even if voters act strategically, (ii) promote consensus rather than polarization and inequality, and (iii) do not favour the status…

General Economics · Economics 2020-06-12 Jobst Heitzig , Forest W. Simmons

Participatory budgeting (PB) is a democratic process where citizens jointly decide on how to allocate public funds to indivisible projects. This paper focuses on PB processes where citizens may give additional money to projects they want to…

Multiagent Systems · Computer Science 2021-05-03 Jiehua Chen , Martin Lackner , Jan Maly

Shortlisting is the process of selecting a subset of alternatives from a larger pool for further consideration or final decision-making. It is widely applied in social choice and multi-agent system scenarios. The growing demand for…

Computer Science and Game Theory · Computer Science 2026-01-30 Edith Elkind , Qishen Han , Lirong Xia

In many machine learning scenarios, looking for the best classifier that fits a particular dataset can be very costly in terms of time and resources. Moreover, it can require deep knowledge of the specific domain. We propose a new technique…

Machine Learning · Computer Science 2022-07-15 Cristina Cornelio , Michele Donini , Andrea Loreggia , Maria Silvia Pini , Francesca Rossi

In an approval-based committee election, the goal is to select a committee consisting of $k$ out of $m$ candidates, based on $n$ voters who each approve an arbitrary number of the candidates. The core of such an election consists of all…

Computer Science and Game Theory · Computer Science 2025-05-15 Dominik Peters

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…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

We introduce a single-winner perspective on voting on matchings, in which voters have preferences over possible matchings in a graph, and the goal is to select a single collectively desirable matching. Unlike in classical matching problems,…

Computer Science and Game Theory · Computer Science 2026-01-28 Niclas Boehmer , Jessica Dierking

There has been much recent work on multiwinner voting systems. However, sometimes a committee is highly structured, and if we want to vote for such a committee, our voting method should be more structured as well. We consider committees…

Computer Science and Game Theory · Computer Science 2022-11-14 Karl-Dieter Crisman

A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. In contrast to a previous article, here the individual votes are allowed to be incomplete, that is, they…

Optimization and Control · Mathematics 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

Schulze voting is a recently introduced voting system enjoying unusual popularity and a high degree of real-world use, with users including the Wikimedia foundation, several branches of the Pirate Party, and MTV. It is a Condorcet voting…

Computer Science and Game Theory · Computer Science 2013-05-27 Curtis Menton , Preetjot Singh

In many real world situations, collective decisions are made using voting and, in scenarios such as committee or board elections, employing voting rules that return multiple winners. In multi-winner approval voting (AV), an agent submits a…

Computer Science and Game Theory · Computer Science 2020-12-08 Jaelle Scheuerman , Jason Harman , Nicholas Mattei , K. Brent Venable

In social choice theory with ordinal preferences, a voting method satisfies the axiom of positive involvement if adding to a preference profile a voter who ranks an alternative uniquely first cannot cause that alternative to go from winning…

Theoretical Economics · Economics 2025-04-01 Wesley H. Holliday

We propose a Condorcet consistent voting method that we call Split Cycle. Split Cycle belongs to the small family of known voting methods satisfying the anti-vote-splitting criterion of independence of clones. In this family, only Split…

Computer Science and Game Theory · Computer Science 2023-11-30 Wesley H. Holliday , Eric Pacuit

This work contributes to a foundational question in economic theory: how do individual-level cognitive biases interact with collective choice mechanisms? We study a setting where voters hold intrinsic preference rankings over a set of…

Theoretical Economics · Economics 2026-02-24 Federico Fioravanti , Zoi Terzopoulou

In representative democracies, the election of new representatives in regular election cycles is meant to prevent corruption and other misbehavior by elected officials and to keep them accountable in service of the ``will of the people."…

Multiagent Systems · Computer Science 2023-02-27 Xiaolin Sun , Jacob Masur , Ben Abramowitz , Nicholas Mattei , Zizhan Zheng

This paper describes COWPEA (Candidates Optimally Weighted in Proportional Election using Approval voting), a method of proportional representation that uses approval voting, also known as random priority, though underdeveloped in the…

Theoretical Economics · Economics 2025-04-23 Toby Pereira

Pull voting is a random process in which vertices of a connected graph have initial opinions chosen from a set of $k$ distinct opinions, and at each step a random vertex alters its opinion to that of a randomly chosen neighbour. If the…

Discrete Mathematics · Computer Science 2024-09-20 Colin Cooper , Tomasz Radzik , Takeharu Shiraga

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á
‹ Prev 1 3 4 5 6 7 10 Next ›