Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking

05/17/2018
by   Jun Wang, et al.
0

STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. However, the literature is surprisingly vague about how ties should be broken. We propose the first algorithms for computing the set of alternatives that are winners under some tiebreaking mechanism under STV and RP, which is also known as parallel-universes tiebreaking (PUT). Unfortunately, PUT-winners are NP-complete to compute under STV and RP, and standard search algorithms from AI do not apply. We propose multiple DFS-based algorithms along with pruning strategies and heuristics to prioritize search direction to significantly improve the performance using machine learning. We also propose novel ILP formulations for PUT-winners under STV and RP, respectively. Experiments on synthetic and real-world data show that our algorithms are overall significantly faster than ILP, while there are a few cases where ILP is significantly faster for RP.

READ FULL TEXT
research
01/16/2019

Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking

STV and ranked pairs (RP) are two well-studied voting rules for group de...
research
06/26/2023

Proportional Aggregation of Preferences for Sequential Decision Making

We study the problem of fair sequential decision making given voter pref...
research
10/10/2022

Obvious Independence of Clones

The Independence of Clones (IoC) criterion for social choice functions (...
research
11/07/2020

How Likely Are Large Elections Tied?

Understanding the likelihood for an election to be tied is a classical t...
research
07/17/2023

LearnedSort as a learning-augmented SampleSort: Analysis and Parallelization

This work analyzes and parallelizes LearnedSort, the novel algorithm tha...
research
06/25/2022

Identifying Possible Winners in Ranked Choice Voting Elections with Outstanding Ballots

Several election districts in the US have recently moved to ranked-choic...
research
05/29/2020

A Fully Dynamic Algorithm for k-Regret Minimizing Sets

Selecting a small set of representatives from a large database is import...

Please sign up or login with your details

Forgot password? Click here to reset