English
Related papers

Related papers: Recovering Single-Crossing Preferences From Approv…

200 papers

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 two-crossing elections as a generalization of single-crossing elections, showing a number of new results. First, we show that two-crossing elections can be recognized in polynomial time, by reduction to the well-studied…

Computer Science and Game Theory · Computer Science 2022-06-28 Andrei Constantinescu , Roger Wattenhofer

We study the complexity of winner determination in single-crossing elections under two classic fully proportional representation rules---Chamberlin--Courant's rule and Monroe's rule. Winner determination for these rules is known to be…

Computer Science and Game Theory · Computer Science 2013-07-05 Piotr Skowron , Lan Yu , Piotr Faliszewski , Edith Elkind

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

To understand and summarize approval preferences and other binary evaluation data, it is useful to order the items on an axis which explains the data. In a political election using approval voting, this could be an ideological left-right…

Computer Science and Game Theory · Computer Science 2024-05-08 Théo Delemazure , Chris Dong , Dominik Peters , Magdaléna Tydrichová

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

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

We address the problem of determining if a discrete time switched consensus system converges for any switching sequence and that of determining if it converges for at least one switching sequence. For these two problems, we provide…

Systems and Control · Computer Science 2015-05-22 Pierre-Yves Chevalier , Julien M. Hendrickx , Raphaël M. Jungers

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

Each voter $i \in I$ has $\alpha_i$ cards that (s)he distributes among the candidates $a \in A$ as a measure of approval. One (or several) candidate(s) who received the maximum number of cards is (are) elected. We provide polynomial…

Combinatorics · Mathematics 2020-10-30 Endre Boros , Ondrej Cepek , Vladimir Gurvich , Kazuhisa Makino

We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…

Computer Science and Game Theory · Computer Science 2014-10-10 Adam Clearwater , Clemens Puppe , Arkadii Slinko

Incomplete pairwise comparison matrices offer a natural way of expressing preferences in decision making processes. Although ordinal information is crucial, there is a bias in the literature: cardinal models dominate. Ordinal models usually…

Optimization and Control · Mathematics 2020-12-15 Luca Faramondi , Gabriele Oliva , Sándor Bozóki

In real-world elections where voters cast preference ballots, voters often provide only a partial ranking of the candidates. Despite this empirical reality, prior social choice literature frequently analyzes fairness criteria under the…

General Economics · Economics 2024-08-08 Adam Graham-Squire , Matthew I. Jones , David McCune

Consider $n$ independent, biased coins, each with a known probability of heads. Presented with an ordering of these coins, flip (i.e., toss) each coin once, in that order, until we have observed both a *head* and a *tail*, or flipped all…

Data Structures and Algorithms · Computer Science 2025-10-21 Feyza Duman Keles , Lisa Hellerstein , Kunal Marwaha , Christopher Musco , Xinchen Yang

We present a polynomial-time algorithm that determines, given some choice rule, whether there exists an obviously strategy-proof mechanism for that choice rule.

Theoretical Economics · Economics 2022-10-25 Louis Golowich , Shengwu Li

We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen…

Computer Science and Game Theory · Computer Science 2019-02-06 Warut Suksompong

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

Computers and Society · Computer Science 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

What does it mean for an algorithm to be biased? In U.S. law, unintentional bias is encoded via disparate impact, which occurs when a selection process has widely different outcomes for different groups, even as it appears to be neutral.…

Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning committee for many ABC rules is NP-hard, natural variations for…

Computer Science and Game Theory · Computer Science 2025-08-06 Zack Fitzsimmons , Zohair Raza Hassan , Edith Hemaspaandra

We study the complexity of determining a winning committee under the Chamberlin--Courant voting rule when voters' preferences are single-crossing on a line, or, more generally, on a median graph (this class of graphs includes, e.g., trees…

Computer Science and Game Theory · Computer Science 2020-10-20 Andrei Constantinescu , Edith Elkind