{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:16:16Z","timestamp":1740122176056,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10458-020-09479-2","type":"journal-article","created":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T08:04:12Z","timestamp":1601539452000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Personalised rating"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1908-5142","authenticated-orcid":false,"given":"Umberto","family":"Grandi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Turrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"9479_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., & Halpern, J. (2006). Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In Proceedings of the 25th ACM symposium on principles of distributed computing (PODC).","DOI":"10.1145\/1146381.1146393"},{"key":"9479_CR2","unstructured":"Alon, N., Feldman, M., Lev, O., & Tennenholtz, M. (2015). How robust is the wisdom of the crowds? In Proceedings of the 24th international conference on artificial intelligence (IJCAI)."},{"key":"9479_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, R., Borgs, C., Chayes, J., Feige, U., Flaxman, A., Kalai, et al. (2008). Trust-based recommendation systems: An axiomatic approach. In Proceedings of the 17th international conference on world wide web (WWW).","DOI":"10.1145\/1367497.1367525"},{"issue":"3","key":"9479_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.3233\/FI-2014-970","volume":"129","author":"KR Apt","year":"2014","unstructured":"Apt, K. R., & Markakis, E. (2014). Social networks with competing products. Fundamenta Informaticae, 129(3), 225\u2013250.","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"9479_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1177\/0022002797041002001","volume":"41","author":"R Axelrod","year":"1997","unstructured":"Axelrod, R. (1997). The dissemination of culture: A model with local convergence and global polarization. Journal of Conflict Resolution, 41(2), 203\u2013226.","journal-title":"Journal of Conflict Resolution"},{"key":"9479_CR6","doi-asserted-by":"crossref","unstructured":"Bahar, G., Smorodinsky, R., & Tennenholtz, M. (2016). Economic recommendation systems (one page abstract). In Proceedings of the 2016 ACM conference on economics and computation (EC).","DOI":"10.1145\/2940716.2940719"},{"key":"9479_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/2297058","volume":"46","author":"S Barber\u00e0","year":"1979","unstructured":"Barber\u00e0, S. (1979). Majority and positional voting in a probabilistic framework. Review of Economic Studies, 46, 379\u2013389.","journal-title":"Review of Economic Studies"},{"key":"9479_CR8","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Erd\u00e9lyi, G., & Rothe, J. (2011). How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation. In Proceedings of the second international conference on algorithmic decision theory (ADT).","DOI":"10.1007\/978-3-642-24873-3_1"},{"key":"9479_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.knosys.2013.03.012","volume":"46","author":"J Bobadilla","year":"2013","unstructured":"Bobadilla, J., Hernando, A., Ortega, F., & Guti\u00e9rrez, A. (2013). Recommender systems survey. Knowledge-Based Systems, 46, 109\u2013132.","journal-title":"Knowledge-Based Systems"},{"key":"9479_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1613\/jair.4285","volume":"50","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Such\u00fd, O., et al. (2014). A multivariate complexity analysis of lobbying in multiple referenda. Journal of Artificial Intelligence Research, 50, 409\u2013446.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9479_CR11","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1613\/jair.4927","volume":"55","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., & Talmon, N. (2016). Large-scale election campaigns: Combinatorial shift bribery. Journal of Artificial Intelligence Research (JAIR), 55, 603\u2013652.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"9479_CR12","unstructured":"Brill, M., Conitzer, V., Freeman, R., & Shah, N. (2016). False-name-proof recommendations in social networks. In Proceedings of the 15th international conference on autonomous agents and multiagent systems (AAMAS)."},{"issue":"3","key":"9479_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10058-007-0028-1","volume":"11","author":"R Christian","year":"2007","unstructured":"Christian, R., Fellows, M., Rosamond, F., & Slinko, A. (2007). On complexity of lobbying in multiple referenda. Review of Economic Design, 11(3), 217\u2013224.","journal-title":"Review of Economic Design"},{"key":"9479_CR14","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Immorlica, N., Letchford, J., Munagala, K., & Wagman, L. (2010). False-name-proofness in social networks. In 6th international workshop on internet and network economics (WINE).","DOI":"10.1007\/978-3-642-17572-5_17"},{"key":"9479_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/CBO9781107446984.007","volume-title":"Handbook of computational social choice, chapter 6","author":"V Conitzer","year":"2016","unstructured":"Conitzer, V., & Walsh, T. (2016). Barriers to manipulation in voting. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of computational social choice, chapter 6 (pp. 127\u2013145). Cambridge: Cambridge University Press."},{"key":"9479_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1159-5","volume-title":"Reputation in artificial societies: Social beliefs for social order","author":"R Conte","year":"2002","unstructured":"Conte, R., & Paolucci, M. (2002). Reputation in artificial societies: Social beliefs for social order. Dordrecht: Kluwer."},{"issue":"2","key":"9479_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1142\/S0219525908001647","volume":"11","author":"R Conte","year":"2008","unstructured":"Conte, R., Paolucci, M., & Sabater-Mir, J. (2008). Reputation for innovating social networks. Advances in Complex Systems, 11(2), 303\u2013320.","journal-title":"Advances in Complex Systems"},{"issue":"6","key":"9479_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MIS.2003.1249168","volume":"18","author":"RK Dash","year":"2003","unstructured":"Dash, R. K., Jennings, N. R., & Parkes, D. C. (2003). Computational-mechanism design: A call to arms. IEEE Intelligent Systems, 18(6), 40\u201347.","journal-title":"IEEE Intelligent Systems"},{"issue":"6","key":"9479_CR19","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1093\/jcr\/ucv047","volume":"42","author":"B de Lange","year":"2016","unstructured":"de Lange, B., Fernbach, P. M., & Lichtenstein, D. R. (2016). Navigating by the stars: Investigating the actual and perceived validity of online user ratings. Journal of Consumer Research, 42(6), 817\u2013833.","journal-title":"Journal of Consumer Research"},{"issue":"1\u20134","key":"9479_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1142\/S0219525900000078","volume":"3","author":"G Deffuant","year":"2000","unstructured":"Deffuant, G., Neau, D., Amblard, F., & Weisbuch, G. (2000). Mixing beliefs among interacting agents. Adv Complex Syst, 3(1\u20134), 87\u201398.","journal-title":"Adv Complex Syst"},{"key":"9479_CR21","volume-title":"Encyclopedia of algorithms","author":"P Faliszewski","year":"2014","unstructured":"Faliszewski, P., & Niedermeier, R. (2014). Parameterization in computational social choice. In M. Y. Kao (Ed.), Encyclopedia of algorithms. Berlin: Springer."},{"key":"9479_CR22","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. A. (2009). How hard is bribery in elections? Journal of Artificial Intelligence Research (JAIR), 35, 485\u2013532.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"9479_CR23","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/1435417.1435435","volume":"52","author":"J Feigenbaum","year":"2009","unstructured":"Feigenbaum, J., Parkes, D. C., & Pennock, D. M. (2009). Computational challenges in e-commerce. Communications of the ACM, 52, 70\u201374.","journal-title":"Communications of the ACM"},{"issue":"4","key":"9479_CR24","doi-asserted-by":"publisher","first-page":"683","DOI":"10.2307\/2297786","volume":"51","author":"P Fishburn","year":"1984","unstructured":"Fishburn, P. (1984). Probabilistic social choice based on simple voting comparisons. Review of Economic Studies, 51(4), 683\u2013692.","journal-title":"Review of Economic Studies"},{"key":"9479_CR25","doi-asserted-by":"crossref","unstructured":"Garcin, F., Faltings, B., Jurca, R., & Joswig, N. (2009). Rating aggregation in collaborative filtering systems. In Proceedings of the third ACM conference on recommender systems (RecSys).","DOI":"10.1145\/1639714.1639785"},{"key":"9479_CR26","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M. R., & Johnson, D. S. (1990). Computers and intractability: A guide to the theory of NP-completeness. New York, NY: W. H. Freeman & Co."},{"issue":"4","key":"9479_CR27","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A. (1973). Manipulation of voting schemes: A general result. Econometrica, 41(4), 587\u2013601.","journal-title":"Econometrica"},{"key":"9479_CR28","unstructured":"Grandi, U., & Turrini, P. (2016). A network-based rating system and its resistance to bribery. In Proceedings of the 25th international joint conference on artificial intelligence (IJCAI)."},{"key":"9479_CR29","doi-asserted-by":"crossref","unstructured":"Grandi, U., Stewart, J., & Turrini, P. (2018). The complexity of bribery in network-based rating systems. In Proceedings of the 32nd AAAI conference on artificial intelligence (AAAI).","DOI":"10.1609\/aaai.v32i1.11474"},{"key":"9479_CR30","first-page":"169","volume-title":"Trends in computational social choice, chapter 9","author":"U Grandi","year":"2017","unstructured":"Grandi, U. (2017). Social choice and social networks. In U. Endriss (Ed.), Trends in computational social choice, chapter 9 (pp. 169\u2013184). El Segundo: AI Access."},{"key":"9479_CR31","first-page":"895","volume":"64","author":"U Grandi","year":"2019","unstructured":"Grandi, U., Grossi, D., & Turrini, P. (2019). Negotiable votes. Journal of Artififial Intelligence Research (JAIR), 64, 895\u2013929.","journal-title":"Journal of Artififial Intelligence Research (JAIR)"},{"key":"9479_CR32","unstructured":"Hegselmann, R., & Krause, U. (2002). Opinion dynamics and bounded confidence: models, analysis and simulation. Journal of Artificial Societies and Social Simulation, 5(3)."},{"key":"9479_CR33","doi-asserted-by":"crossref","unstructured":"Helpman, E., & Persson, T. (1998). Lobbying and legislative bargaining. Working paper 6589, National Bureau of Economic Research.","DOI":"10.3386\/w6589"},{"key":"9479_CR34","unstructured":"Kurokawa, D., Lev, O., Morgenstern, J., & Procaccia, A. D. (2015). Impartial peer review. In Proceedings of the 24th international joint conference on artificial intelligence (IJCAI)."},{"key":"9479_CR35","doi-asserted-by":"crossref","unstructured":"Lev, O., & Tennenholtz, M. (2017). Group recommendations: Axioms, impossibilities, and random walks. In Proceedings of the 16th conference on theoretical aspects of rationality and knowledge (TARK).","DOI":"10.4204\/EPTCS.251.28"},{"issue":"1","key":"9479_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-011-9277-z","volume":"40","author":"I Pinyol","year":"2013","unstructured":"Pinyol, I., & Sabater-Mir, J. (2013). Computational trust and reputation models for open multi-agent systems: A review. Artificial Intelligence Review, 40(1), 1\u201325.","journal-title":"Artificial Intelligence Review"},{"issue":"1","key":"9479_CR37","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10462-004-0041-5","volume":"24","author":"J Sabater","year":"2005","unstructured":"Sabater, J., & Sierra, C. (2005). Review on computational trust and reputation models. Artificial Intelligence Review, 24(1), 33\u201360.","journal-title":"Artificial Intelligence Review"},{"issue":"2","key":"9479_CR38","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"MA Satterthwaite","year":"1975","unstructured":"Satterthwaite, M. A. (1975). Strategy-proofness and Arrow\u2019s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory, 10(2), 187\u2013217.","journal-title":"Journal of Economic Theory"},{"issue":"3","key":"9479_CR39","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/B:AGNT.0000038029.82331.c0","volume":"9","author":"C Sierra","year":"2004","unstructured":"Sierra, C. (2004). Agent-mediated electronic commerce. Autonomous Agents and Multi-Agent Systems, 9(3), 285\u2013301.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"1","key":"9479_CR40","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1093\/logcom\/ext012","volume":"25","author":"S Simon","year":"2015","unstructured":"Simon, S., & Apt, K. R. (2015). Social network games. Journal of Logic and Computation, 25(1), 207\u2013242.","journal-title":"Journal of Logic and Computation"},{"key":"9479_CR41","unstructured":"Streitfeld, D. (2016). Online reviews: Researchers give them a low rating. The New York Times. https:\/\/www.nytimes.com\/2016\/06\/09\/technology\/online-reviews-researchers-give-them-a-low-rating.html."},{"key":"9479_CR42","unstructured":"Tennenholtz, M. (2008). Game-theoretic recommendations: some progress in an uphill battle. In Proceedings of the 7th international joint conference on autonomous agents and multiagent systems (AAMAS)."},{"key":"9479_CR43","unstructured":"Todo, T., & Conitzer, V. (2013). False-name-proof matching. In International conference on autonomous agents and multi-agent systems (AAMAS)."},{"key":"9479_CR44","unstructured":"Waggoner, B., Xia, L., & Conitzer, V. (2012). Evaluating resistance to false-name manipulations in elections. In Proceedings of the twenty-sixth AAAI conference on artificial intelligence (AAAI)."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-020-09479-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-020-09479-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-020-09479-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T14:11:19Z","timestamp":1669039879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-020-09479-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9479"],"URL":"https:\/\/doi.org\/10.1007\/s10458-020-09479-2","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"1 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"55"}}