Published on Tue Mar 14 2017

Weighted Voting Via No-Regret Learning

Nika Haghtalab, Ritesh Noothigattu, Ariel D. Procaccia

Voting systems typically treat all voters equally. We argue that perhaps they shouldn't. Voters who have supported good choices in the past should be given higher weight than bad ones.

0
0
0
Abstract

Voting systems typically treat all voters equally. We argue that perhaps they should not: Voters who have supported good choices in the past should be given higher weight than voters who have supported bad ones. To develop a formal framework for desirable weighting schemes, we draw on no-regret learning. Specifically, given a voting rule, we wish to design a weighting scheme such that applying the voting rule, with voters weighted by the scheme, leads to choices that are almost as good as those endorsed by the best voter in hindsight. We derive possibility and impossibility results for the existence of such weighting schemes, depending on whether the voting rule and the weighting scheme are deterministic or randomized, as well as on the social choice axioms satisfied by the voting rule.

Fri Nov 29 2019
Artificial Intelligence
Heuristic Strategies in Uncertain Approval Voting Environments
In real world voting scenarios, people do not have complete information about other voter preferences and it can be computationally complex to identify a strategy that will maximize their utility. In a behavioral experiment, we show that people vote truthfully in some situations and prioritize high utility candidates in others.
0
0
0
Fri Oct 27 2017
Artificial Intelligence
Multiwinner Voting with Fairness Constraints
Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. If candidates have sensitive attributes such as gender or ethnicity, an algorithm that chooses a subset by optimizing a multiwinner voting rule may be unbalanced in its
0
0
0
Wed May 19 2021
Artificial Intelligence
Surprisingly Popular Voting Recovers Rankings, Surprisingly!
0
0
0
Thu Jan 04 2018
Artificial Intelligence
Utilitarian Welfare and Representation Guarantees of Approval-Based Multiwinner Rules
This paper provides a quantitative analysis of multiwinner voting rules. We estimate how well multiwinner rules approximate two extreme objectives. These objectives are a representation criterion and a utilitarian criterion. With both theoretical and experimental methods, we classify multiwinner rules.
0
0
0
Sat Feb 08 2020
Artificial Intelligence
Majority Voting and the Condorcet's Jury Theorem
There is a striking relationship between a three hundred years old Political.Science theorem named "Condorcet's jury. theorem" (1785) and a modern Machine Learning concept called "Strength of Weak Learnability" (1990) We could not find a compact and simple rigorousMathematical
0
0
0
Wed Jul 04 2012
Artificial Intelligence
Common Voting Rules as Maximum Likelihood Estimators
Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote. It produces as output either just the winning alternative or a ranking of the alternatives.
0
0
0