Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"2-majority tournaments"”.
-
Upset Paths and 2-Majority Tournaments
<p>In 2005, Alon, et al. proved that tournaments arising from majority voting scenarios have minimum dominating sets that are bounded by a constant that depends only on the notion of what is meant by a majority. Moreover, they proved that when a majority means that Candidate A beats Candidate B …
-
REALIZING TOURNAMENTS AS MODELS FOR K-MAJORITY VOTING
<p>A <em>k</em>-majority tournament is a directed graph that models a <em>k</em>-majority voting scenario, which is realized by 2<em>k</em> - 1 rankings, called linear orderings, of the vertices in the tournament. Every <em>k</em>-majority voting scenario can be modeled by a tournament, but not …