Unfair permutations (Q648984)

In this paper the authors consider permutations generated by letting \(n\) players draw \(n\) times from the uniform distribution, where player \(i\) draws \(i\) times and reports the maximum number drawn. They call these permutations ``unfair'', and obtain detailed statistics about them. For example, they compute the mean and variance of the number of players ranked below player \(i\) and the number of anti-inversions. The formulas typically involve rational functions of \(n\) and the harmonic numbers.