Abstract
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 given tournament solutions, we define the disparity index as the order of the smallest tournament for which the solutions differ and the separation index as the order of the smallest tournament for which the corresponding choice sets are disjoint. Isolated bounds on both values for selected tournament solutions are known from the literature. In this paper, we address these questions systematically using an exhaustive computer analysis. Among other results, we provide the first tournament in which the bipartisan set and the Banks set are not contained in each other.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
