On parameterized complexity of liquid democracy

DOI10.1007/978-3-030-67899-9_7OpenAlexW3126980190MaRDI QIDQ831697FDOQ831697

Authors: Palash Dey, Arnab Maiti, Amatya Sharma 

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2011.14192

zbMATH Keywords

parameterized complexityliquid democracyresolve delegation to MinMaxWeight

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• The directed subgraph homeomorphism problem
• Title not available (Why is that?)
• The fluid mechanics of liquid democracy
• Strategic voting and nomination
• Title not available (Why is that?)
• Liquid Democracy: An Algorithmic Perspective

Cited In (2)

• Pirates in wonderland: liquid democracy has bicriteria guarantees
• Unveiling the truth in liquid democracy with misinformed voters

This page was built for publication: On parameterized complexity of liquid democracy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831697)