The voter basis and the admissibility of tree characters

DOI10.1007/S11083-021-09553-8zbMATH Open1492.91123arXiv1809.08332OpenAlexW3130700193MaRDI QIDQ2665833FDOQ2665833

Authors: Andrew Beveridge, Ian Calaway 

Publication date: 19 November 2021

Published in: Order (Search for Journal in Brave)

Abstract: When making simultaneous decisions, our preference for the outcomes on one subset can depend on the outcomes on a disjoint subset. In referendum elections, this gives rise to the separability problem, where a voter must predict the outcome of one proposal when casting their vote on another. A set $Ssubset[n]$ is separable for preference order $succeq$ when our ranking of outcomes on $S$ is independent of outcomes on its complement $[n]-S$. The admissibility problem asks which characters $mathcalCsubsetmathcalP([n])$ can arise as the collection of separable subsets for some preference order. We introduce a linear algebraic technique to construct preference orders with desired characters. Each vector in our $2^n$-dimensional voter basis induces a simple preference ordering with nice separability properties. Given any collection $mathcalCsubsetmathcalP([n])$ whose subset lattice has a tree structure, we use the voter basis to construct a preference order with character $mathcalC$.

Full work available at URL: https://arxiv.org/abs/1809.08332

Recommendations

• Symmetry extensions of ``neutrality. II: Partial ordering of dictionaries
• Permutations of separable preference orders
• A note on the voting problem
• Preference orders on families of sets -- when can impossibility results be avoided?
• Approval voting under dichotomous preferences: a catalogue of characterizations

zbMATH Keywords

separabilityadmissibilityHasse diagramtotal orderpower setpreference order

Mathematics Subject Classification ID

Social choice (91B14) Voting theory (91B12) Total orders (06A05)

Cites Work

• The on-line encyclopedia of integer sequences
• Intuitive Probability on Finite Sets
• The Mathematics of Voting and Elections: A Hands-On Approach
• Boolean term orders and the root system \(B_n\)
• Finite linear qualitative probability
• Flippable pairs and subset comparisons in comparative probability orderings
• Voting, the symmetric group, and representation theory
• Separable discrete preferences
• Preseparable extensions of multidimensional preferences
• Classifying interdependence in multidimensional binary preferences
• Additive representability of finite measurement structures
• The mathematics of referendum elections and separable preferences
• Cubic preferences and the character admissibility problem

Uses Software

• OEIS

This page was built for publication: The voter basis and the admissibility of tree characters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665833)