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.
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- Robert W. Rosenthal. 1973. A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory 2, 65--67.Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
Recommendations
User Preferences for Automated Curation of Snackable Content
IUI '21: 26th International Conference on Intelligent User InterfacesAs the volume of content and the connectivity of social media have grown, snackable content has increasingly become an enjoyable and engaging way to share content. Snackable content is a shortened form of original content focusing on a single theme or ...
Distributed content curation on the web
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. We consider the problem of curating this vast catalogue of content such ...
Content Curation for Spatial Experience of Architectural Heritage
Augmented space can be usefully applied to cultural heritage experience, because it is possible to experience physical space and acquire information at the same time. Experiencers can expand their experiences through virtual content while feeling the ...






Comments