Bounds on the disparity and separation of tournament solutions

@article{Brandt2015BoundsOT,
  title={Bounds on the disparity and separation of tournament solutions},
  author={Felix Brandt and Andre Dau and Hans Georg Seedig},
  journal={Discrete Applied Mathematics},
  year={2015},
  volume={187},
  pages={41-49}
}
A tournament solution is a function that maps a tournament, i.e., a directed graph representing an asymmetric and connex relation on a finite set of alternatives, to a non-empty subset of the alternatives. Tournament solutions play an important role in social choice theory, where the binary relation is typically defined via pairwise majority voting. If the number of alternatives is sufficiently small, different tournament solutions may return overlapping or even identical choice sets. For two… CONTINUE READING
BETA

Figures, Tables, and Topics from this paper.

Similar Papers

Loading similar papers…