Towards Efficiently Implementing Dodgson’s Formally Intractable Voting Rule
| dc.contributor.author | Recknagel, Arne | |
| dc.contributor.author | Besold, Tarek R. | |
| dc.date.accessioned | 2018-01-08T08:13:05Z | |
| dc.date.available | 2018-01-08T08:13:05Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | Conflict of interest is the permanent companion of any population of agents (computational or biological). For that reason, the ability to compromise is of paramount importance, making voting a key element of societal mechanisms. A voting procedure often discussed in the literature and, due to its intuitiveness, also conceptually quite appealing is Charles Dodgson’s scoring rule, basically using the respective closeness to being a Condorcet winner for evaluating competing alternatives. In this paper, we offer insights into the practical limits of algorithms computing the exact Dodgson scores from a number of votes. While the problem itself is theoretically intractable, this work proposes and analyses five different solutions which try distinct approaches to practically solve the issue in an effective manner. Additionally, three of the discussed procedures can be run in parallel which has the potential of drastically improving computational performance on the problem. | |
| dc.identifier.pissn | 1610-1987 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/11053 | |
| dc.publisher | Springer | |
| dc.relation.ispartof | KI - Künstliche Intelligenz: Vol. 31, No. 2 | |
| dc.relation.ispartofseries | KI - Künstliche Intelligenz | |
| dc.subject | Benchmark | |
| dc.subject | Computational social choice | |
| dc.subject | Dodgson rule | |
| dc.subject | Implementation | |
| dc.subject | Parallel computing | |
| dc.title | Towards Efficiently Implementing Dodgson’s Formally Intractable Voting Rule | |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 167 | |
| gi.citation.startPage | 161 |