{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:16:25Z","timestamp":1762298185541,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"2-3","license":[{"start":{"date-parts":[[2014,10,28]],"date-time":"2014-10-28T00:00:00Z","timestamp":1414454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2014,10,28]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/2663489","type":"journal-article","created":{"date-parts":[[2014,10,28]],"date-time":"2014-10-28T12:40:29Z","timestamp":1414500029000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Distributed Content Curation on the Web"],"prefix":"10.1145","volume":"14","author":[{"given":"Zeinab","family":"Abbassi","sequence":"first","affiliation":[{"name":"Columbia University, New York, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidhi","family":"Hegde","sequence":"additional","affiliation":[{"name":"Technicolor, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Massouli\u00e9","sequence":"additional","affiliation":[{"name":"Microsoft Research - INRIA Joint Centre, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,28]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/1386790.1386832"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1287\/moor.1110.0499"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1145\/1963405.1963428"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1145\/989459.989467"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1007\/978-3-642-10841-9_65"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the Workshop on Social Computing and User-Generated Content.","author":"May Avner","year":"2013","unstructured":"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. 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."},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1007\/BF01737559"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1145\/1536414.1536485"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.5555\/645413.652124"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2663489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2663489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:48Z","timestamp":1750227168000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2663489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,28]]},"references-count":9,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2014,10,28]]}},"alternative-id":["10.1145\/2663489"],"URL":"https:\/\/doi.org\/10.1145\/2663489","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"type":"print","value":"1533-5399"},{"type":"electronic","value":"1557-6051"}],"subject":[],"published":{"date-parts":[[2014,10,28]]},"assertion":[{"value":"2013-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}