English
Related papers

Related papers: Paradoxes in Sequential Voting

200 papers

We initiate the work towards a comprehensive picture of the smoothed satisfaction of voting axioms, to provide a finer and more realistic foundation for comparing voting rules. We adopt the smoothed social choice framework, where an…

Theoretical Economics · Economics 2021-06-04 Lirong Xia

We study sequential multi-issue trading between two greedily rational agents who exchange resources from a finite set of categories. Each agent's utility depends on its allocation, but the offering agent does not know the responding agent's…

Multiagent Systems · Computer Science 2026-05-15 Surya Murthy , Mustafa O. Karabag , Ufuk Topcu

In frequently repeated matching scenarios, individuals may require diversification in their choices. Therefore, when faced with a set of potential outcomes, each individual may have an ideal lottery over outcomes that represents their…

Computer Science and Game Theory · Computer Science 2024-04-29 Rasoul Ramezanian

Voting mechanisms are widely accepted and used methods for decentralized decision-making. Ensuring the acceptance of the voting mechanism's outcome is a crucial characteristic of robust voting systems. Consider this scenario: A group of…

Theoretical Economics · Economics 2024-07-03 Jeremias Lenzi

This thesis considers sequential decision problems, where the loss/reward incurred by selecting an action may not be inferred from observed feedback. A major part of this thesis focuses on the unsupervised sequential selection problem,…

Machine Learning · Computer Science 2022-12-23 Arun Verma

It is well known that no reasonable voting rule is strategyproof. Moreover, the common Plurality rule is particularly prone to strategic behavior of the voters and empirical studies show that people often vote strategically in practice.…

Computer Science and Game Theory · Computer Science 2014-04-22 Reshef Meir , Omer Lev , Jeffrey S. Rosenschein

Strategic voting, or manipulation, is the process by which a voter misrepresents his preferences in an attempt to elect an outcome that he considers preferable to the outcome under sincere voting. It is generally agreed that manipulation is…

Computer Science and Game Theory · Computer Science 2022-11-10 Egor Ianovski , Daria Teplova , Valeriia Kuka

Previous work on voter control, which refers to situations where a chair seeks to change the outcome of an election by deleting, adding, or partitioning voters, takes for granted that the chair knows all the voters' preferences and that all…

Computer Science and Game Theory · Computer Science 2016-06-20 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

The well-known Condorcet Jury Theorem states that, under majority rule, the better of two alternatives is chosen with probability approaching one as the population grows. We study an asymmetric setting where voters face varying…

Computer Science and Game Theory · Computer Science 2025-10-22 Reshef Meir , Ganesh Ghalme

In many real world situations, collective decisions are made using voting. Moreover, scenarios such as committee or board elections require voting rules that return multiple winners. In multi-winner approval voting (AV), an agent may vote…

Computer Science and Game Theory · Computer Science 2019-05-31 Jaelle Scheuerman , Jason L. Harman , Nicholas Mattei , K. Brent Venable

The paper considers a general model of electoral systems combining district-based elections with a compensatory mechanism in order to create any outcome between strictly majoritarian and purely proportional seat allocation. It contains vote…

Computer Science and Game Theory · Computer Science 2017-10-27 László Csató

This paper formalizes the lattice structure of the ballot voters cast in a ranked-choice election and the preferences that this structure induces. These preferences are shown to be counter to previous assumptions about the preferences of…

Theoretical Economics · Economics 2023-01-10 Brian Duricy

Lu and Boutilier proposed a novel approach based on "minimax regret" to use classical score based voting rules in the setting where preferences can be any partial (instead of complete) orders over the set of alternatives. We show here that…

Multiagent Systems · Computer Science 2017-11-13 Palash Dey

Datasets are often generated in a sequential manner, where the previous samples and intermediate decisions or interventions affect subsequent samples. This is especially prominent in cases where there are significant human-AI interactions,…

Information Retrieval · Computer Science 2022-05-30 Ali Shirali

We consider the problem of sequential evaluation, in which an evaluator observes candidates in a sequence and assigns scores to these candidates in an online, irrevocable fashion. Motivated by the psychology literature that has studied…

Machine Learning · Statistics 2023-11-20 Jingyan Wang , Ashwin Pananjady

Shortlisting of candidates--selecting a group of "best" candidates--is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the perhaps…

Multiagent Systems · Computer Science 2019-08-15 Robert Bredereck , Andrzej Kaczmarczyk , Rolf Niedermeier

Consider Plurality with random tie-breaking. This paper uses standard axiomatic extensions of preferences over elements to preferences over sets (Kelly, Gardenfors, Responsiveness) to characterize all better-replies of a voter under…

Computer Science and Game Theory · Computer Science 2016-09-07 Reshef Meir

We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an…

Computational Complexity · Computer Science 2010-04-22 Gábor Erdélyi , Michael Fellows

One goal of online social recommendation systems is to harness the wisdom of crowds in order to identify high quality content. Yet the sequential voting mechanisms that are commonly used by these systems are at odds with existing…

Social and Information Networks · Computer Science 2016-03-16 L. Elisa Celis , Peter M. Krafft , Nathan Kobe

Voting rules allow multiple agents to aggregate their preferences in order to reach joint decisions. Perhaps one of the most important desirable properties in this context is Condorcet-consistency, which requires that a voting rule should…

Computer Science and Game Theory · Computer Science 2016-02-26 Felix Brandt , Christian Geist , Dominik Peters