Abstract
We study single-winner STV from the point of view of communication. First, we assume that voters give, in a single shot, their top-k alternatives; we define a version of STV that works for such votes, and we evaluate empirically the extent to which it approximates the standard STV rule. Second, we evaluate empirically the communication cost of the protocol for STV defined by Conitzer and Sandholm (2005) and some of its improvements.
Cite
CITATION STYLE
Ayadi, M., Amor, N. B., & Lang, J. (2018). The communication burden of single transferable vote, in practice. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11059 LNCS, pp. 251–255). Springer Verlag. https://doi.org/10.1007/978-3-319-99660-8_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
