Key points are not available for this paper at this time.
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a bucket order is a total order that allows "ties" between items in a bucket. A bucket order B can be viewed as a "representative" that summarizes a given set of full rankings T1, T2,. . . , Tm, or conversely B can be an "approximation" of some "ground truth" G where the rankings T1, T2,. . . , Tm are simply the "linear extensions" of G.
Feng et al. (Mon,) studied this question.