The Communication Burden of Single Transferable Vote, in Practice

  • Manel AyadiEmail author
  • Nahla Ben AmorEmail author
  • Jérôme LangEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11059)


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.


  1. 1.
    Baumeister, D., Faliszewski, P., Lang, J., Rothe, J.: Campaigns for lazy voters: truncated ballots. In: Proceedings AAMAS, pp. 577–584 (2012)Google Scholar
  2. 2.
    Conitzer, V., Sandholm, T.: Communication complexity of common voting rules. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 78–87. ACM (2005)Google Scholar
  3. 3.
    Filmus, Y., Oren, J.: Efficient voting via the top-k elicitation scheme: a probabilistic approach. In: Proceedings of ACM Conference on Economics and Computation, pp. 295–312 (2014)Google Scholar
  4. 4.
    Jiang, C., Sikdar, S., Wang, J., Xia, L., Zhao, Z.: Practical algorithms for computing STV and other multi-round voting rules. In: EXPLORE-2017: The 4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (2017)Google Scholar
  5. 5.
    Mattei, N., Walsh, T.: PrefLib: a library for preferences In: Perny, P., Pirlot, M., Tsoukiàs, A. (eds.) ADT 2013. LNCS (LNAI), vol. 8176, pp. 259–270. Springer, Heidelberg (2013). Scholar
  6. 6.
    Naamani-Dery, L., Kalech, M., Rokach, L., Shapira, B.: Reducing preference elicitation in group decision making. Expert Syst. Appl. 61, 246–261 (2016)CrossRefGoogle Scholar
  7. 7.
    Oren, J., Filmus, Y., Boutilier, C.: Efficient vote elicitation under candidate uncertainty. In: Proceedings of IJCAI, pp. 309–316. AAAI Press (2013)Google Scholar
  8. 8.
    Skowron, P., Faliszewski, P., Slinko, A.: Achieving fully proportional representation: approximability results. Artif. Intell. 222, 67–103 (2015)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.LARODEC, Institut Supérieur de GestionUniversité de TunisTunisTunisie
  2. 2.CNRS, LAMSADEUniversité Paris-DauphineParisFrance

Personalised recommendations