On the computational complexity of malpractices in liquid democracy
Source
Indian Institute of Technology, Gandhinagar
Date Issued
2024-01-01
Author(s)
More, Yash Hiren
Subjects
Minimum Budget-Computational Complexity-Election
Polynomial-Time Algorithm
Polynomial-Time Dynamic Programming Algorithm
