Moreover, the algorithm produces a sparse representation of the stochastic ranking policy as a weighted sum of permutation matrices. In other words, this gives us a Birkhoff-von-Neumann decomposition [1]} of the bistochastic matrices for free, avoiding the overhead of an additional decomposition algorithm as in existing works on fair ranking [2]}, [3]}, [4]}.
