As Time Goes By: Adding a Temporal Dimension Towards Resolving Delegations in Liquid Democracy

07/24/2023
by   Evangelos Markakis, et al.
0

In recent years, the study of various models and questions related to Liquid Democracy has been of growing interest among the community of Computational Social Choice. A concern that has been raised, is that current academic literature focuses solely on static inputs, concealing a key characteristic of Liquid Democracy: the right for a voter to change her mind as time goes by, regarding her options of whether to vote herself or delegate her vote to other participants, till the final voting deadline. In real life, a period of extended deliberation preceding the election-day motivates voters to adapt their behaviour over time, either based on observations of the remaining electorate or on information acquired for the topic at hand. By adding a temporal dimension to Liquid Democracy, such adaptations can increase the number of possible delegation paths and reduce the loss of votes due to delegation cycles or delegating paths towards abstaining agents, ultimately enhancing participation. Our work takes a first step to integrate a time horizon into decision-making problems in Liquid Democracy systems. Our approach, via a computational complexity analysis, exploits concepts and tools from temporal graph theory which turn out to be convenient for our framework.

READ FULL TEXT
research
09/13/2019

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints

Computing a (shortest) path between two vertices in a graph is one of th...
research
06/15/2020

Algorithmic Aspects of Temporal Betweenness

The betweenness centrality of a graph vertex measures how often this ver...
research
03/14/2018

Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles

In this paper we prove that the general avalanche problem AP is in NC, f...
research
11/02/2017

The Computational Complexity of Finding Separators in Temporal Graphs

Vertex separators, that is, vertex sets whose deletion disconnects two d...
research
10/06/2021

A logical approach for temporal and multiplex networks analysis

Many systems generate data as a set of triplets (a, b, c): they may repr...
research
05/12/2021

Two Influence Maximization Games on Graphs Made Temporal

To address the dynamic nature of real-world networks, we generalize comp...
research
04/28/2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs

Treewidth is arguably the most important structural graph parameter lead...

Please sign up or login with your details

Forgot password? Click here to reset