An approval-based model for single-step liquid democracy
From MaRDI portal
Publication:2670941
DOI10.1007/978-3-030-85947-3_24zbMath1492.91263OpenAlexW3199278443MaRDI QIDQ2670941
Evangelos Markakis, Georgios Papasotiropoulos
Publication date: 1 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85947-3_24
Cites Work
- Unnamed Item
- Unnamed Item
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- Popular branchings and their dual certificates
- Parameterized complexity of fair deletion problems
- The fluid mechanics of liquid democracy
- The convergence of iterative delegations in liquid democracy in a social network
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Monadic second order logic on graphs with local cardinality constraints
- Easy problems for tree-decomposable graphs
- Algorithmic Meta-theorems
- A Tight Analysis of the Greedy Algorithm for Set Cover
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Liquid Democracy: An Algorithmic Perspective
This page was built for publication: An approval-based model for single-step liquid democracy