Nash Equilibria of Rock Paper Scissors Variants

We generalize Rock Paper Scissors to complete directed graphs, or tournaments, on $n$ vertices. Properties of the mixed-strategy Nash equilibria of these tournaments are discussed, particularly those with Nash equilibria where all of the strategies have a nonzero probability. We find graph-theoretic properties of such games and tabulate them for $n \leq 7$.
Comment: 18 pages