The Communication Burden of Single Transferable Vote, in Practice

@inproceedings{Ayadi2018TheCB,
  title={The Communication Burden of Single Transferable Vote, in Practice},
  author={Manel Ayadi and Nahla Ben Amor and J{\'e}r{\^o}me Lang},
  booktitle={SAGT},
  year={2018}
}
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. 

Winner Determination under Common Voting Rules using Truncated Ballots. (Détermination du gagnant à partir des règles de vote communes à l'aide des bulletins tronqués)

TLDR
This dissertation focuses on voting with partial preferences in the form of top-k ballots and proposes and analyze different methods allowing a compromise between the accuracy of the result and the amount of communication required; some require only one round of communication, while others are interactive.

References

SHOWING 1-10 OF 22 REFERENCES

Communication complexity of common voting rules

TLDR
The communication complexity of the common voting rules is determined by giving a deterministic communication protocol and an upper bound on the number of bits communicated in it; then, a lower bound on (even the nondeterministic) communication requirements of the voting rule is given.

Proportional Representation in Vote Streams

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common

An Empirical Study of the Manipulability of Single Transferable Voting

  • T. Walsh
  • Economics, Computer Science
    ECAI
  • 2010
TLDR
Empirically, the manipulability of single transferable voting (STV) is studied to determine if computational complexity is really a barrier to manipulation.

Campaigns for lazy voters: truncated ballots

We study elections in which voters may submit partial ballots consisting of truncated lists: each voter ranks some of her top candidates (and possibly some of her bottom candidates) and is

Practical voting rules with partial information

TLDR
An iterative algorithm is proposed that allows the agents to send only part of their preferences, incrementally, and results in an average of 35% savings in communications, while guaranteeing that the actual winning candidate is revealed.

Efficient voting via the top-k elicitation scheme: a probabilistic approach

TLDR
This work focuses on arbitrary positional scoring rules in which the voters' scores for the candidates is given by a vector that assigns the ranks real values, and provides a succinct set of criteria sufficient for obtaining both lower and upper bounds on the minimal k necessary to determine the true winner with high probability.

Incomplete Information and Communication in Voting

TLDR
This chapter provides an overview of a variety of topics related to the information and communication requirements of voting, with a focus on determining winners or making decisions with incomplete or stochastic information about voter preferences—or in some cases, about the alternatives themselves.

On the Axiomatic Characterization of Runoff Voting Rules

TLDR
It is shown that STV is the only runoff scoring rule satisfying an independence-of-clones property and axiomatizations of Baldwin's rule and Coombs' rule are provided.

Fishing out Winners from Vote Streams

TLDR
Non-trivial upper and lower bounds on the space complexity of $\eps$-winner determination for several voting rules, including $k-approval, $k$-veto, scoring rules, approval, maximin, Bucklin, Copeland, and plurality with run off are shown.

Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs

TLDR
A probabilistic analysis of vote elicitation is proposed that combines the advantages of incremental elicitation schemes--namely, minimizing the amount of information revealed--with those of full information schemes--single (or few) rounds of elicitation.