Iterative Ranking from Pair-wise Comparisons
The question of aggregating pairwise comparisons to obtain a global ranking over a collection of objects has been of interest for a very long time: be it ranking of online gamers (e.g. MSR's TrueSkill system) and chess players, aggregating social opinions, or deciding which product to sell base...
Main Authors: | Negahban, Sahand N., Oh, Sewoong, Shah, Devavrat |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137118.2 |
Similar Items
-
Iterative ranking from pair-wise comparisons
by: Shah, Devavrat, et al.
Published: (2021) -
Rank Centrality: Ranking from Pairwise Comparisons
by: Negahban, Sahand, et al.
Published: (2017) -
Iterative Learning for Reliable Crowdsourcing Systems
by: Karger, David R., et al.
Published: (2012) -
Budget-Optimal Crowdsourcing Using Low-Rank Matrix Approximations
by: Karger, David R., et al.
Published: (2012) -
Learning Mixed Multinomial Logit Model from Ordinal Data
by: Oh, Sewoong, et al.
Published: (2016)