IaSI: Find player rankings with I&SI method

In nmmarquez/linHierarchy: Generate linear rankings from dyadic interactions within a group

Description

Implements I&SI method for finding a "linear hierarchy" among players

Usage

IaSI(intData, max.iter = 100)

Arguments

intData	object of class "interData" to find player rankings
max.iter	the maximum number of iterations for the algorithm to run

Details

Applies the methods described in Han de Vries 1998 to find a linear hierarchy amongst interacting members of a group. The algorithm attempts to minimize the number of occurences where a player of low ranking wins a majority of interactions over a higher ranking player. If the algorithm finds an ordering where this even never occurs it will immeadiately exit and return the result.

Value

a list with - a data frame with all players sorted by their ranking - a list detailing the number of inconsistancies and strength of inconstancies - the dominance matrix reflecting the ranking order

References

Han de Vries (1998) Finding a Dominance Order Most Consistant with a Linear Hierarchy.

Examples

# generate generic data
interactions <- data.frame (a = sample (letters [1:10], 100, T),
                            b = sample (letters [1:10], 100, T),
                            o = sample (c(-1,-1,0,1,1), 100, T),
                            d = Sys.time () + runif (100, 40, 160))
# convert to interData object
id1 <- intTableConv (interactions)
# apply I&SI method for finding a linear hierarchy
IaSI (id1)

nmmarquez/linHierarchy documentation built on May 23, 2019, 9:28 p.m.