{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:11Z","timestamp":1750307711267,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"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":["SIGecom Exch."],"published-print":{"date-parts":[[2008,11]]},"abstract":"<jats:p>In this letter, we outline a new approach to modeling, analyzing, and combating manipulative attacks on recommender systems.<\/jats:p>","DOI":"10.1145\/1486877.1486887","type":"journal-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T14:41:13Z","timestamp":1232462473000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Manipulation-resistant recommender systems through influence limits"],"prefix":"10.1145","volume":"7","author":[{"given":"Paul","family":"Resnick","sequence":"first","affiliation":[{"name":"School of Information, University of Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Sami","sequence":"additional","affiliation":[{"name":"School of Information, University of Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,11]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA '07)","author":"BHATTACHARJEE R.","year":"2007","unstructured":"BHATTACHARJEE , R. AND GOEL , A. 2007 . Algorithms and incentives for robust ranking . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA '07) . BHATTACHARJEE, R. AND GOEL, A. 2007. Algorithms and incentives for robust ranking. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA '07)."},{"volume-title":"Prediction, Learning, and Games","author":"CESA-BIANCHI N.","key":"e_1_2_1_2_1","unstructured":"CESA-BIANCHI , N. AND LUGOSI , G. 2006. Prediction, Learning, and Games . Cambridge University Press . CESA-BIANCHI, N. AND LUGOSI, G. 2006. Prediction, Learning, and Games. Cambridge University Press."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1097047.1097061"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_36"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988726"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216295.1216307"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390350"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278366.1278372"},{"key":"e_1_2_1_9_1","unstructured":"NEWITZ A. 2007. I bought votes on digg. Wired Magazine. Available at http:\/\/www.wired.com\/techbiz\/people\/news\/2007\/03\/72832.  NEWITZ A. 2007. I bought votes on digg. Wired Magazine. Available at http:\/\/www.wired.com\/techbiz\/people\/news\/2007\/03\/72832."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/648315.756187"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111449.1111477"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297231.1297236"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454033"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297231.1297249"},{"key":"e_1_2_1_15_1","first-page":"196","volume-title":"In Proceedings of AAAI'08","author":"WAGMAN L.","year":"2008","unstructured":"WAGMAN , L. AND CONITZER , V. 2008 . In Proceedings of AAAI'08 . 196 - 201 . WAGMAN, L. AND CONITZER, V. 2008. In Proceedings of AAAI'08. 196-201."}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1486877.1486887","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1486877.1486887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:11Z","timestamp":1750253411000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1486877.1486887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["10.1145\/1486877.1486887"],"URL":"https:\/\/doi.org\/10.1145\/1486877.1486887","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2008,11]]},"assertion":[{"value":"2008-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}