Sorting from Noisy Information

Non-null ranking models

C. L. Mallows · 1957

Earlier work this paper cites.

Spearman’s footrule as a measure of disarray

Persi Diaconis and R. L. Graham · 1977

Earlier work this paper cites.

Distance based ranking models

M. A. Flinger and J.S. Verducci · 1986

Earlier work this paper cites.

Group representations in probability and statistics

Persi Diaconis · 1988

Earlier work this paper cites.

Multistage ranking models

M. A. Flinger and J.S. Verducci · 1988

Earlier work this paper cites.

Voting schemes for which it can be difficult to tell who won the election

J. Bartholdi, III, C. A. Tovey, and M. A. Trick · 1989

Earlier work this paper cites.

Computing with unreliable information

U. Feige, D. Peleg, P. Raghavan, and E. Upfal · 1990

Cited alongside, same era.

Posterior probability for a consensus ordering

M. A. Flinger and J.S. Verducci · 1990

Cited alongside, same era.

Learning to order things

William W. Cohen, Robert E. Schapire, and Yoram Singer · 1999

Cited alongside, same era.

Aggregating inconsistent information: ranking and clustering

N. Ailon, M. Charikar, and A. Newman · 2005

Cited alongside, same era.

Ranking tournaments

N. Alon · 2006

Cited alongside, same era.

Ordering by weighted number of wins gives a good ranking for weighted tournaments

Don Coppersmith, Lisa Fleischer, and Atri Rudra · 2006

Later among the works it cites.

Noisy binary serach and its applications

D. Karp and B. Kleinberg · 2007

Later among the works it cites.

How to rank with few errors

C. Kenyon-Mathieu and W. Schudy · 2007

Later among the works it cites.

Consenus ranking under the exponential model

Original

M. Meila, K. Phandis, A. Patterson, and J. Blimes · 2007

Later among the works it cites.

Noisy sorting without resampling

M. Braverman and E. Mossel · 2008

Later among the works it cites.