What majority decisions are possible with possible abstaining
Combinatorics
2014-03-11 v1
Abstract
Suppose we are given a family of choice functions on pairs from a given finite set. The set is considered as a set of alternatives (say candidates for an office) and the functions as potential "voters". The question is, what choice functions agree, on every pair, with the majority of some finite subfamily of the voters? For the problem as stated, a complete characterization was given in \citet{shelah2009mdp}, but here we allow each voter to abstain. There are four cases.
Cite
@article{arxiv.1003.2756,
title = {What majority decisions are possible with possible abstaining},
author = {Paul Larson and Nick Matteo and Saharon Shelah},
journal= {arXiv preprint arXiv:1003.2756},
year = {2014}
}
Comments
23 pages