Resolving multi-proxy transitive vote delegation
Multiagent Systems
2014-12-15 v1
Abstract
Solving a delegation graph for transitive votes is already a non-trivial task for many programmers. When extending the current main paradigm, where each voter can only appoint a single transitive delegation, to a system where each vote can be separated over multiple delegations, solving the delegation graph becomes even harder. This article presents a solution of an example graph, and a non-formal proof of why this algorithm works.
Cite
@article{arxiv.1412.4039,
title = {Resolving multi-proxy transitive vote delegation},
author = {Jonas Degrave},
journal= {arXiv preprint arXiv:1412.4039},
year = {2014}
}