In a framework with two parties, deterministic voter preferences and a type of geographical constraints, we propose a set of simple axioms and show that they jointly characterize the districting rule that maximizes the number of districts one party can win, given the distribution of individual...

Can neural networks learn to select an alternative based on a systematic aggregation of conflicting individual preferences (i.e. a 'voting rule')? And if so, which voting rule best describes their behavior? We show that a prominent neural network can be trained to respect two fundamental...

Voting rules can be assessed from quite different perspectives: the axiomatic, the pragmatic, in terms of computational or conceptual simplicity, susceptibility to manipulation, and many others aspects. In this paper, we take the machine learning perspective and ask how 'well' a few prominent...

We characterize the preference domains on which the Borda count satisfies Arrow's ``independence of irrelevant alternatives" condition. Under a weak richness condition, these domains are obtained by fixing one preference ordering and including all its cyclic permutations (``Condorcet cycles")....