Description Usage Arguments Details Value References See Also Examples
Try to compute find a Condorcet choice given a full ranking of m objects.
1 |
data |
the data, a vector of counts of each permutation of the m objects (m is the length of data) |
names |
character vector of the names of the m objects |
In a ranking of m objects, the Condorcet choice is the choice that wins over every other choice in pairwise comparisons. See Marden (1995), p.20 for details.
...
Marden, J. I. (1995). Analyzing and Modeling Rank Data, London: Chapman & Hall. p.20.
1 2 3 4 5 6 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.