{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:15:23Z","timestamp":1761401723266,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,4,17]],"date-time":"2014-04-17T00:00:00Z","timestamp":1397692800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2014,4,17]]},"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. 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\/2627534.2627544","type":"journal-article","created":{"date-parts":[[2014,5,27]],"date-time":"2014-05-27T12:56:59Z","timestamp":1401195419000},"page":"30-33","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed content curation on the web"],"prefix":"10.1145","volume":"41","author":[{"given":"Zeinab","family":"Abbassi","sequence":"first","affiliation":[{"name":"Columbia University"}]},{"given":"Nidhi","family":"Hegde","sequence":"additional","affiliation":[{"name":"Technicolor, France"}]},{"given":"Laurent","family":"Massouli\u00e9","sequence":"additional","affiliation":[{"name":"Microsoft Research INRIA, Joint Centre, France"}]}],"member":"320","published-online":{"date-parts":[[2014,4,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386832"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0499"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963428"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/989459.989467"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_65"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_2_1_7_1","volume-title":"FOCS '02, page 416","author":"Vetta A.","year":"2002","unstructured":"A. Vetta . Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions . In FOCS '02, page 416 . IEEE Computer Society , 2002 . A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In FOCS '02, page 416. IEEE Computer Society, 2002."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2627534.2627544","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/2627534.2627544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:35Z","timestamp":1750230095000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2627534.2627544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,17]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4,17]]}},"alternative-id":["10.1145\/2627534.2627544"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/2627534.2627544","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2014,4,17]]},"assertion":[{"value":"2014-04-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}