  In this paper we study the inverse of so-called unfair permutations, and
explore various properties of them. Our investigation begins with comparing
this class of permutations with uniformly random permutations, and showing that
they behave very much alike for locally dependent random variables. As an
example of a globally dependent statistic we use the number of inversions, and
show that this statistic satisfies a central limit theorem after proper
centering and scaling. A secondary example of a globally dependent statistic to
be studied will be the number of fixed points. Finally, we introduce two
different generalizations of inverse-unfair permutations.
