Thumbnail

The Communication Burden of Single Transferable Vote, in Practice

Ayadi, Manel; Ben Amor, Nahla; Lang, Jérôme (2018), The Communication Burden of Single Transferable Vote, in Practice, in Deng, Xiaotie, Algorithmic Game Theory 11th International Symposium (SAGT 2018), Springer International Publishing : Cham, p. 251-255. 10.1007/978-3-319-99660-8_23

View/Open
Type
Communication / Conférence
Date
2018
Conference title
11th International Symposium on Algorithmic Game Theory (SAGT 2018)
Conference date
2018-09
Conference city
Beijing
Conference country
China
Book title
Algorithmic Game Theory 11th International Symposium (SAGT 2018)
Book author
Deng, Xiaotie
Publisher
Springer International Publishing
Published in
Cham
ISBN
978-3-319-99659-2
Number of pages
276
Pages
251-255
Publication identifier
Metadata
Show full item record
Author(s)
Ayadi, Manel
Laboratoire de Recherche Opérationnelle de Décision et de Contrôle de Processus [LARODEC]
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ben Amor, Nahla
Laboratoire de Recherche Opérationnelle de Décision et de Contrôle de Processus [LARODEC]
Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
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.
Subjects / Keywords
Game theory; Voting