Description Usage Arguments Details Value Author(s) References See Also Examples
de Vries' I&SI ranking
1 |
mat |
square interaction matrix with winner in rows and losers in columns, for example the output from |
runs |
numeric, number of iterations, by default |
printmessages |
logical, should the number of I and SI be printed (as well as a message if there is more than one solution). By default |
The number of interations is set substantially higher than what was suggested in the de Vries' 1998 paper, because my algorithm here is less efficient.
The I&SI algorithm (c.f. de Vries 1998) does not necessarily result in a unique order (see example below). If such a case occurs, all (equally good) solutions are returned as a list.
The function checks whether a table
is supplied instead of a matrix
and converts from table to matrix if possible (trying to keep the column and row names if supplied in the table).
If the matrix does not have column-names, unique column- and row-names are assigned.
a list with the best possible matrix (or matrices if there is more than one best solution)
Christof Neumann
devries1998EloRating
1 2 3 4 5 6 7 8 9 10 11 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.