University of Cambridge > > Optimization and Incentives Seminar > A Theoretical Analysis of Crowdsourced Content Curation

A Theoretical Analysis of Crowdsourced Content Curation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Felix Fischer.

Today, the internet is flooded with vast quantities of content created both by professionals and amatuers. To cope with this information overload, users seek the help of curators to recommend which content to consume. The two most common forms of curation are expert-based, the editor of a newspaper decides which articles to place on the front page, and algorithmic-based, a search algorithm determining the ranking of websites for a given query. In recent years, content aggregators which use explicit vote-based feedback from users to curate content for future users have grown exponentially in popularity. The goal of this paper is to provide a descriptive analysis of crowd-sourced curation mechanisms.

In particular, we study crowd-curation mechanisms that rank articles according to a score which is a function of user-feedback. We quantify the extent to which the highly promoted articles of a crowd-curator actually represent the preferences of the user population. While crowd-curation can be relatively effective for cardinal objectives like discovering and promoting content of high quality, they do not perform well for ordinal objectives such as finding the best articles. Our analysis suggests that user preferences and behavior are a far greater determinant of curation quality than the actual details of the curation mechanism. Finally, we show that certain shifts in user voting behavior can have positive impacts on these systems, suggesting that active moderation of user behavior is important for high quality curation in crowd-sourced systems.

This is joint work with Yorgos Askalidis.

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity