2 papers
cs.MA2026
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…
cs.GT2025
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…