Origins of Algorithmic Instabilities in Crowdsourced Ranking
Keith Burghardt, Tad Hogg, Raissa M. D'Souza, Kristina Lerman, Marton, Posfai

TL;DR
This paper investigates how human judgment heuristics and option quality interact in crowdsourcing, revealing potential instabilities in popularity rankings and proposing an inference-based algorithm to improve ranking accuracy.
Contribution
It introduces a model of judgment heuristics affecting rankings and develops an algorithm that outperforms traditional popularity-based methods under certain conditions.
Findings
Popularity rankings can be unstable without sufficient quality difference.
The proposed algorithm guarantees optimal ranking if data matches the model.
Simulations show the algorithm performs well even when data deviates from the model.
Abstract
Crowdsourcing systems aggregate decisions of many people to help users quickly identify high-quality options, such as the best answers to questions or interesting news stories. A long-standing issue in crowdsourcing is how option quality and human judgement heuristics interact to affect collective outcomes, such as the perceived popularity of options. We address this limitation by conducting a controlled experiment where subjects choose between two ranked options whose quality can be independently varied. We use this data to construct a model that quantifies how judgement heuristics and option quality combine when deciding between two options. The model reveals popularity-ranking can be unstable: unless the quality difference between the two options is sufficiently high, the higher quality option is not guaranteed to be eventually ranked on top. To rectify this instability, we create an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
