11 citations · 12 across the 5 of their papers we have counts for
6 papers
The Communication Complexity of Instant-Runoff Voting
Élie de Panafieu, François Durand, Jérôme Lang
The communication complexity of a voting rule is the worst-case number of bits that n voters must transmit to a central authority under the most efficient elicitation protocol in a…
Constrained Serial Dictatorships can be Fair
Sylvain Bouveret, Hugo Gilbert, Jérôme Lang +1
When allocating indivisible items to agents, it is known that the only strategyproof mechanisms that satisfy a set of rather mild conditions are constrained serial dictatorships: g…
Understanding Political Divisiveness using Online Participation data from the 2022 French and Brazilian Presidential Elections
Carlos Navarrete, Mariana Macedo, Rachael Colley +8
Digital technologies can augment civic participation by facilitating the expression of detailed political preferences. Yet, digital participation efforts often rely on methods opti…
Sequential Elimination Voting Games
Ulysse Pavloff, Tristan Cazenave, Jérôme Lang
Voting by sequential elimination is a low-communication voting protocol: voters play in sequence and eliminate one or more of the remaining candidates, until only one remains. Whil…
Approval with Runoff
Théo Delemazure, Jérôme Lang, Jean-François Laslier +1
We define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With appro…
Online Approval Committee Elections
Virginie Do, Matthieu Hervouin, Jérôme Lang +1
Assume candidates need to be selected. The candidates appear over time. Each time one appears, it must be immediately selected or rejected -- a decision that is made by a group…