English
Related papers

Related papers: A continuous rating method for preferential voting…

200 papers

A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…

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

A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. The proposed method is proved to satisfy certain desirable conditions, among which there is a majority…

Optimization and Control · Mathematics 2009-12-12 Rosa Camps , Xavier Mora , Laia Saumell

Actual individual preferences are neither complete (=total) nor antisymmetric in general, so that at least every quasi-order must be an admissible input to a satisfactory choice rule. It is argued that the traditional notion of…

Combinatorics · Mathematics 2007-05-23 Jobst Heitzig

Approval-preferential voting is problematical since it combines two different kinds of information that could by themselves lead to different choices. This article analyses the problem and studies a new proposal to deal with it. The…

Computer Science and Game Theory · Computer Science 2021-01-12 Rosa Camps , Xavier Mora , Laia Saumell

Aggregating preferences under incomplete or constrained feedback is a fundamental problem in social choice and related domains. While prior work has established strong impossibility results for pairwise comparisons, this paper extends the…

Computer Science and Game Theory · Computer Science 2025-02-19 Evi Micha , Vasilis Varsamis

We investigate approval-based committee voting with incomplete information about the approval preferences of voters. We consider several models of incompleteness where each voter partitions the set of candidates into approved, disapproved,…

Computer Science and Game Theory · Computer Science 2024-08-21 Aviram Imber , Jonas Israel , Markus Brill , Benny Kimelfeld

We extend Approval voting to the settings where voters may have intransitive preferences. The major obstacle to applying Approval voting in these settings is that voters are not able to clearly determine who they should approve or…

Computer Science and Game Theory · Computer Science 2017-02-28 Yongjie Yang

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We…

Computer Science and Game Theory · Computer Science 2019-04-19 Oren Dean , Yakov Babichenko , Moshe Tennenholtz

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…

Computer Science and Game Theory · Computer Science 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

Platforms for online civic participation rely heavily on methods for condensing thousands of comments into a relevant handful, based on whether participants agree or disagree with them. These methods should guarantee fair representation of…

Computer Science and Game Theory · Computer Science 2023-12-25 Daniel Halpern , Gregory Kehne , Ariel D. Procaccia , Jamie Tucker-Foltz , Manuel Wüthrich

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

Computer Science and Game Theory · Computer Science 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

A method is given for determining a mixed social choice out of a paired-comparison matrix. The method combines a projection procedure introduced in previous papers of the same authors and a classical method due to Zermelo. The resulting…

Combinatorics · Mathematics 2015-05-06 Rosa Camps , Xavier Mora , Laia Saumell

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under…

Computer Science and Game Theory · Computer Science 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov

Several rules for social choice are examined from a unifying point of view that looks at them as procedures for revising a system of degrees of belief in accordance with certain specified logical constraints. Belief is here a social…

Artificial Intelligence · Computer Science 2015-05-06 Rosa Camps , Xavier Mora , Laia Saumell

We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…

Optimization and Control · Mathematics 2007-05-23 Pavel Chebotarev , Elena Shamis

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron

Incomplete preferences are likely to arise in real-world preference aggregation scenarios. This paper deals with determining whether an incomplete preference profile is single-peaked. This is valuable information since many intractable…

Computer Science and Game Theory · Computer Science 2020-04-15 Zack Fitzsimmons , Martin Lackner

The traditional axiomatic approach to voting is motivated by the problem of reconciling differences in subjective preferences. In contrast, a dominant line of work in the theory of voting over the past 15 years has considered a different…

Discrete Mathematics · Computer Science 2015-12-19 Flavio Chierichetti , Jon Kleinberg

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

Computer Science and Game Theory · Computer Science 2021-05-03 Martin Lackner , Jan Maly
‹ Prev 1 2 3 10 Next ›