8 citations · 12 across the 13 of their papers we have counts for
3 papers · 1 filter
Finding single-source shortest -disjoint paths: fast computation and sparse preservers
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà +3
Let be a directed graph with vertices, edges, and non-negative edge costs. Given , a fixed source vertex , and a positive integer , we consider the problem of…
When Can Liquid Democracy Unveil the Truth?
Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz +1
In this paper, we investigate the so-called ODP-problem that has been formulated by Caragiannis and Micha [10]. Here, we are in a setting with two election alternatives out of whic…
Computation and Bribery of Voting Power in Delegative Simple Games
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Following Zhang and Grossi~(AAAI 2021), we study in more depth a variant of weighted voting games in which agents' weights are induced by a transitive support structure. This class…