Algorithmic Techniques for Necessary and Possible Winners

05/14/2020
by   Vishal Chakraborty, et al.
0

We investigate the practical aspects of computing the necessary and possible winners in elections over incomplete voter preferences. In the case of the necessary winners, we show how to implement and accelerate the polynomial-time algorithm of Xia and Conitzer. In the case of the possible winners, where the problem is NP-hard, we give a natural reduction to Integer Linear Programming (ILP) for all positional scoring rules and implement it in a leading commercial optimization solver. Further, we devise optimization techniques to minimize the number of ILP executions and, oftentimes, avoid them altogether. We conduct a thorough experimental study that includes the construction of a rich benchmark of election data based on real and synthetic data. Our findings suggest that, the worst-case intractability of the possible winners notwithstanding, the algorithmic techniques presented here scale well and can be used to compute the possible winners in realistic scenarios.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2020

Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms

This paper is devoted to a study of single-peakedness on arbitrary graph...
research
12/07/2022

Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond

We study the problem of finding elements in the intersection of an arbit...
research
12/26/2019

A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti

We consider the problem of computing the strong rainbow connection numbe...
research
02/17/2023

Finding Possible and Necessary Winners in Spatial Voting with Partial Information

We consider spatial voting where candidates are located in the Euclidean...
research
05/18/2020

Computing the Extremal Possible Ranks with Incomplete Preferences

In an election via a positional scoring rule, each candidate receives fr...
research
05/05/2021

CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints

Bridging logical and algorithmic reasoning with modern machine learning ...
research
12/14/2020

Reflections on kernelizing and computing unrooted agreement forests

Phylogenetic trees are leaf-labelled trees used to model the evolution o...

Please sign up or login with your details

Forgot password? Click here to reset