English
Related papers

Related papers: Computing the proportional veto core

200 papers

We revisit the recent breakthrough result of Gkatzelis et al. on (single-winner) metric voting, which showed that the optimal distortion of 3 can be achieved by a mechanism called Plurality Matching. The rule picks an arbitrary candidate…

Computer Science and Game Theory · Computer Science 2025-02-05 Fatih Erdem Kizilkaya , David Kempe

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

We study the setting of committee elections, where a group of individuals needs to collectively select a given size subset of available objects. This model is relevant for a number of real-life scenarios including political elections,…

Computer Science and Game Theory · Computer Science 2021-08-05 Grzegorz Pierczyński , Piotr Skowron

We study the problem of selecting a statement that finds common ground across diverse population preferences. Generative AI is uniquely suited for this task because it can access a practically infinite set of statements, but AI systems like…

Computer Science and Game Theory · Computer Science 2026-03-18 Jay Chooi , Paul Gölz , Ariel D. Procaccia , Benjamin Schiffer , Shirley Zhang

We study voting rules with respect to how they allow or limit a majority from dominating minorities: whether a voting rule makes a majority powerful, and whether minorities can veto the candidates they do not prefer. For a given voting…

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

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 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 the metric distortion problem there is a set of candidates $C$ and voters $V$ in the same metric space. The goal is to select a candidate minimizing the social cost: the sum of distances of the selected candidate from all the voters, and…

Computer Science and Game Theory · Computer Science 2024-07-12 Ben Berger , Michal Feldman , Vasilis Gkatzelis , Xizhi Tan

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

Motivated by civic problems such as participatory budgeting and multiwinner elections, we consider the problem of public good allocation: Given a set of indivisible projects (or candidates) of different sizes, and voters with different…

Computer Science and Game Theory · Computer Science 2021-10-26 Kamesh Munagala , Yiheng Shen , Kangning Wang , Zhiyi Wang

Core stability is a natural and well-studied notion for group fairness in multi-winner voting, where the task is to select a committee from a pool of candidates. We study the setting where voters either approve or disapprove of each…

Computer Science and Game Theory · Computer Science 2025-12-19 Ratip Emin Berker , Emanuel Tewolde , Vincent Conitzer , Mingyu Guo , Marijn Heule , Lirong Xia

In an approval-based committee election, the task is to select a committee of up to $k$ candidates from a set of $m$ candidates based on the preferences of $n$ voters, each of whom approves a subset of the candidates. A central open…

Computer Science and Game Theory · Computer Science 2026-05-08 Patrick Becker , Matthias Greger , Dominik Peters

Consider the decision-making setting where agents elect a panel by expressing both positive and negative preferences. Prominently, in constitutional AI, citizens democratically select a slate of ethical preferences on which a foundation…

Computer Science and Game Theory · Computer Science 2025-03-05 Sonja Kraiczy , Georgios Papasotiropoulos , Grzegorz Pierczyński , Piotr Skowron

We introduce a general framework for exploring the problem of selecting a committee of representatives with the aim of studying a networked voting rule based on a decentralized large-scale platform, which can assure a strong accountability…

Physics and Society · Physics 2018-01-17 Alexis R. Hernandez , Carlos Gracia-Lazaro , Edgardo Brigatti , Yamir Moreno

The metric distortion framework posits that n voters and m candidates are jointly embedded in a metric space such that voters rank candidates that are closer to them higher. A voting rule's purpose is to pick a candidate with minimum total…

Computer Science and Game Theory · Computer Science 2023-07-03 Fatih Erdem Kizilkaya , David Kempe

Voting algorithms have been widely used as consensus protocols in the realization of fault-tolerant systems. These algorithms are best suited for distributed systems of nodes with low computational power or heterogeneous networks, where…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-12-16 Sebastian Müller , Andreas Penzkofer , Darcy Camargo , Olivia Saa

Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case…

Artificial Intelligence · Computer Science 2009-05-25 Toby Walsh

An energy community is modeled as a cooperative game, where a veto player is needed beyond the prosumers to manage the community, and the worth of a coalition is its benefit compared to the selfish behaviour of the prosumers. Properties of…

Optimization and Control · Mathematics 2026-02-27 Giancarlo Bigi , Davide Fioriti , Antonio Frangioni , Mauro Passacantando , Davide Poli

In the context of single-winner ranked-choice elections between $m$ candidates, we explore the tradeoff between two competing goals in every democratic system: the majority principle (maximizing the social welfare) and the minority…

Computer Science and Game Theory · Computer Science 2025-07-25 Fatih Erdem Kizilkaya , David Kempe

The property of proportional representation in approval-based committee elections has appeared in the social choice literature for over a century, and is typically understood as avoiding the underrepresentation of minorities. However, we…

Data Structures and Algorithms · Computer Science 2021-09-14 Alfonso Cevallos , Alistair Stewart
‹ Prev 1 2 3 10 Next ›