English
Related papers

Related papers: Optimal Bounds for the No-Show Paradox via SAT Sol…

200 papers

Multi-winner voting rules based on approval ballots have received increased attention in recent years. In particular Satisfaction Approval Voting (SAV) and its variants have been proposed. In this note, we show that the winning set can be…

Computer Science and Game Theory · Computer Science 2015-01-12 Haris Aziz , Toby Walsh

Proportional representation (PR) is often discussed in voting settings as a major desideratum. For the past century or so, it is common both in practice and in the academic literature to jump to single transferable vote (STV) as the…

Computer Science and Game Theory · Computer Science 2018-06-05 Haris Aziz , Barton Lee

We study electoral campaign management scenarios in which an external party can buy votes, i.e., pay the voters to promote its preferred candidate in their preference rankings. The external party's goal is to make its preferred candidate a…

Computer Science and Game Theory · Computer Science 2010-11-29 Edith Elkind , Piotr Faliszewski

We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms…

Combinatorics · Mathematics 2017-01-24 Oliver Kullmann , Xishun Zhao

Facing an unknown situation, a person may not be able to firmly elicit his/her preferences over different alternatives, so he/she tends to express uncertain preferences. Given a community of different persons expressing their preferences…

Artificial Intelligence · Computer Science 2017-08-11 Yiru Zhang , Tassadit Bouadi , Arnaud Martin

We consider a voting setting where candidates have preferences about the outcome of the election and are free to join or leave the election. The corresponding candidacy game, where candidates choose strategically to participate or not, has…

Computer Science and Game Theory · Computer Science 2016-02-25 Jérôme Lang , Nicolas Maudet , Maria Polukarov , Alice Cohen-Hadria

A large amount of literature in social choice theory deals with quantifying the probability of certain election outcomes. One way of computing the probability of a specific voting situation under the Impartial Anonymous Culture assumption…

Optimization and Control · Mathematics 2014-06-23 Achill Schürmann

Social Choice theory generalizes voting on one proposal to ranking multiple proposals. Yet, while a vote on a single proposal has the status quo (Reality) as a default, Reality has been forsaken during this generalization. Here, we propose…

Computers and Society · Computer Science 2019-05-17 Ehud Shapiro , Nimrod Talmon

We study settings in which agents with incomplete preferences need to make a collective decision. We focus on a process of majority dynamics where issues are addressed one at a time and undecided agents follow the opinion of the majority.…

Computer Science and Game Theory · Computer Science 2022-05-03 Sirin Botan , Simon Rey , Zoi Terzopoulou

When selecting a subset of candidates (a so-called committee) based on the preferences of voters, proportional representation is often a major desideratum. When going beyond simplistic models such as party-list or district-based elections,…

Computer Science and Game Theory · Computer Science 2023-02-07 Markus Brill , Jannik Peters

In social choice theory, anonymity (all agents being treated equally) and neutrality (all alternatives being treated equally) are widely regarded as ``minimal demands'' and ``uncontroversial'' axioms of equity and fairness. However, the ANR…

Computer Science and Game Theory · Computer Science 2023-07-14 Lirong Xia

In approval voting, individuals vote for all platforms that they find acceptable. In this situation it is natural to ask: When is agreement possible? What conditions guarantee that some fraction of the voters agree on even a single…

Combinatorics · Mathematics 2021-08-30 Kristen Mazur , Mutiara Sondjaja , Matthew Wright , Carolyn Yarnall

Consider a set $V$ of voters, represented by a multiset in a metric space $(X,d)$. The voters have to reach a decision -- a point in $X$. A choice $p\in X$ is called a $\beta$-plurality point for $V$, if for any other choice $q\in X$ it…

Computational Geometry · Computer Science 2023-12-20 Arnold Filtser , Omrit Filtser

We study a model of proxy voting where the candidates, voters, and proxies are all located on the real line, and instead of voting directly, each voter delegates its vote to the closest proxy. The goal is to find a set of proxies that is…

Computer Science and Game Theory · Computer Science 2020-12-15 Elliot Anshelevich , Zack Fitzsimmons , Rohit Vaish , Lirong Xia

We consider the problem of predicting winners in elections, for the case where we are given complete knowledge about all possible candidates, all possible voters (together with their preferences), but where it is uncertain either which…

Computer Science and Game Theory · Computer Science 2016-03-27 Krzysztof Wojtas , Krzysztof Magiera , Tomasz Miąsko , Piotr Faliszewski

We focus on a generalization of the classic Minisum approval voting rule, introduced by Barrot and Lang (2016), and referred to as Conditional Minisum (CMS), for multi-issue elections with preferential dependencies. Under this rule, voters…

Computer Science and Game Theory · Computer Science 2025-06-10 Evangelos Markakis , Georgios Papasotiropoulos

Sortition is based on the idea of choosing randomly selected representatives for decision making. The main properties that make sortition particularly appealing are fairness -- all the citizens can be selected with the same probability --…

Computer Science and Game Theory · Computer Science 2024-06-04 Soroush Ebadian , Evi Micha

In this note we consider situations of (multidimensional) spatial majority voting. We show that under some assumptions usual in this literature, with an even number of voters if the core of the voting situation is singleton (and in the…

Theoretical Economics · Economics 2022-08-16 Anindya Bhattacharya , Francesco Ciardiello

This paper introduces Propose or Vote (PoV), a democratic procedure for collective decision-making and elections that does not rely on a central mechanism designer. In the first stage, members of a polity choose whether to become…

Theoretical Economics · Economics 2025-12-23 Hans Gersbach

In approval-based committee (ABC) voting, the goal is to choose a subset of predefined size of the candidates based on the voters' approval preferences over the candidates. While this problem has attracted significant attention in recent…

Computer Science and Game Theory · Computer Science 2023-12-15 Martin Bullinger , Chris Dong , Patrick Lederer , Clara Mehler