The minimal covering set in large tournaments
We prove that in almost all large tournaments, the minimal covering set is the entire set of alternatives. That is, as the number of alternatives gets large, the probability that the minimal covering set of a uniformly chosen random tournament is the entire set of alternatives goes to one. In contra...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2012
|