On Parameterized Complexity of Liquid Democracy

11/28/2020
by   Palash Dey, et al.
0

In liquid democracy, each voter either votes herself or delegates her vote to some other voter. This gives rise to what is called a delegation graph. To decide the voters who eventually votes along with the subset of voters whose votes they give, we need to resolve the cycles in the delegation graph. This gives rise to the Resolve Delegation problem where we need to find an acyclic sub-graph of the delegation graph such that the number of voters whose votes they give is bounded above by some integer λ. Putting a cap on the number of voters whose votes a voter gives enable the system designer restrict the power of any individual voter. The Resolve Delegation problem is already known to be NP-hard. In this paper we study the parameterized complexity of this problem. We show that Resolve Delegation is para-NP-hard with respect to parameters λ, number of sink nodes and the maximum degree of the delegation graph. We also show that Resolve Delegation is W[1]-hard even with respect to the treewidth of the delegation graph. We complement our negative results by exhibiting FPT algorithms with respect to some other parameters. We finally show that a related problem, which we call Resolve Fractional Delegation, is polynomial time solvable.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/27/2019

On the Parameterized Complexity of Sparsest Cut and Small-set Expansion Problems

We study the NP-hard k-Sparsest Cut problem (kSC) in which, given an und...
07/12/2017

Defensive Alliances in Graphs of Bounded Treewidth

A set S of vertices of a graph is a defensive alliance if, for each elem...
05/31/2018

A Parameterized Complexity View on Collapsing k-Cores

We study the NP-hard graph problem Collapsed k-Core where, given an undi...
07/20/2022

Computing Tree Decompositions with Small Independence Number

The independence number of a tree decomposition is the maximum of the in...
02/23/2021

A Refined Complexity Analysis of Fair Districting over Graphs

We study the NP-hard Fair Connected Districting problem: Partition a ver...
03/15/2012

Algorithms and Complexity Results for Exact Bayesian Structure Learning

Bayesian structure learning is the NP-hard problem of discovering a Baye...
03/21/2022

On the Parameterized Complexity of the Maximum Exposure Problem

We investigate the parameterized complexity of Maximum Exposure Problem ...