Possible and necessary winners of partial tournaments
We study the problem of computing possible and necessary winners for partially specified weighted and unweighted tournaments. This problem arises naturally in elections with incompletely specified votes, partially completed sports competitions, and more generally in any scenario where the outcome of...
| Main Authors: | , , , , , |
|---|---|
| Format: | Journal article |
| Published: |
Association for the Advancement of Artificial Intelligence
2016
|