skip to main content
research-article

Distributed Content Curation on the Web

Published:28 October 2014Publication History
Skip Abstract Section

Abstract

In recent years there has been an explosive growth of digital content in the form of news feeds, videos, and original content on online platforms such as blogs and social networks. Indeed, such platforms have been used as a means of sharing and republishing information, leading to a large collection of content that users must sift through. We consider the problem of curating this vast catalogue of content such that aggregators or publishers can offer readers content that is of interest to them, with minimal spam. Under a game-theoretic model we obtain several results on the optimal content selection and on the efficiency of distributed curation.

References

  1. Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, and Alexander Skopalik. 2008. Fast convergence to nearly optimal solutions in potential games. In Proceedings of the ACM Conference on Electronic Commerce (EC'08). 264--273. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, and Maxim Sviridenko. 2011. Tight approximation algorithms for maximum separable assignment problems. Math. Oper. Res. 36, 3, 416--431. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Arpita Ghosh and Preston McAfee. 2011. Incentivizing high-quality user-generated content. In Proceedings of the 20th International Conference on World Wide Web (WWW'11). ACM Press, New York, 137--146. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni, and Marina Thottan. 2004. Market sharing games applied to content distribution in ad-hoc networks. In Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'04). 55--66. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Mangesh Gupte, MohammadTaghi Hajiaghayi, Lu Han, Liviu Iftode, Pravin Shankar, and Raluca M. Ursu. 2009. News posting by strategic users in a social network. In Proceedings of the 5th International Workshop on Internet and Network Economics Internet and Network Economics (WINE'09), Stefano Leonardi, Ed. Lecture Notes in Computer Science, vol. 5929. Springer, 632--639. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Avner May, Augustin Chaintreau, Nitish Korula, and Silvio Lattanzi. 2013. Game in the newsroom: Greedy bloggers for picky audience. In Proceedings of the Workshop on Social Computing and User-Generated Content.Google ScholarGoogle Scholar
  7. Robert W. Rosenthal. 1973. A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory 2, 65--67.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Tim Roughgarden. 2009. Intrinsic robustness of the price of anarchy. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC'09). ACM Press, New York, 513--522. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Adrian Vetta. 2002. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS'02). IEEE Computer Society, 416. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader
About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!