We study how to learn multiple latent rankings from pairwise comparisons. We propose a novel probabilistic model to capture the process of pairwise comparison. We develop an efficient inference algorithm to learn multiple latent rankings. We also investigate active learning problem considering crowdsourcing platforms. Experiments with synthetic and real life data show the effectiveness of our algorithms.