{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T05:40:36Z","timestamp":1696311636458},"reference-count":33,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T00:00:00Z","timestamp":1395100800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence"],"published-print":{"date-parts":[[2015,11]]},"abstract":"Establishing cooperation and protecting individuals from selfish and malicious behavior are key goals in open multiagent systems. Incomplete information regarding potential interaction partners can undermine typical cooperation mechanisms such as trust and reputation, particularly in lightweight systems designed for individuals with significant resource constraints. In this article, we (i) propose extending a low\u2010cost reputation mechanism to use gossiping to mitigate against the effect of incomplete information, (ii) define four simple aggregation strategies for incorporating gossiped information, and (iii) evaluate our model on a variety of synthetic and real\u2010world topologies and under a range of configurations. We show that (i) gossiping can significantly reduce the potentially detrimental influence of incomplete information and the underlying network structure on lightweight reputation mechanisms, (ii) basing decisions on the most recently received gossip results in up to a 25% reduction in selfishness, and (iii) gossiping is particularly effective at aiding agents with little or no interaction history, such as when first entering a system.<\/jats:p>","DOI":"10.1111\/coin.12036","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T08:36:40Z","timestamp":1395131800000},"page":"569-592","source":"Crossref","is-referenced-by-count":0,"title":["Robust Reputation in Decentralized Markets"],"prefix":"10.1111","volume":"31","author":[{"given":"Henry","family":"Franks","sequence":"first","affiliation":[{"name":"Department of Computer Science University of Warwick Coventry UK"}]},{"given":"Nathan","family":"Griffiths","sequence":"additional","affiliation":[{"name":"Department of Computer Science University of Warwick Coventry UK"}]}],"member":"311","published-online":{"date-parts":[[2014,3,18]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_2_8_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-008-9073-6"},{"key":"e_1_2_8_4_1","doi-asserted-by":"crossref","unstructured":"Bako B. I.Rikanovic F.Kargl andE.Schoch.2007.Adaptive topology based gossiping in VANETs using position information. InProceedings of the 3rd International Conference on Mobile Ad\u2010hoc and Sensor Networks Beijing China pp.66\u201378.","DOI":"10.1007\/978-3-540-77024-4_8"},{"key":"e_1_2_8_5_1","doi-asserted-by":"publisher","DOI":"10.1177\/1043463107085441"},{"key":"e_1_2_8_6_1","unstructured":"Buchegger S.2005.Coping with misbehavior in mobile ad\u2010hoc networks Ph.D. dissertation Ecole Polytechnique Federale de Lausanne Lausanne Switzerland."},{"key":"e_1_2_8_7_1","doi-asserted-by":"crossref","unstructured":"Costa P. D.Gavidia B.Koldehofe H.Miranda M.Musolesi andO.Riva.2008.When cars start gossiping.InProceedings of the 6th Workshop on Middleware for Network Eccentric and Mobile Applications Glasgow UK pp.1\u20134.","DOI":"10.1145\/1435467.1435468"},{"key":"e_1_2_8_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00262-X"},{"key":"e_1_2_8_9_1","unstructured":"Eppstein D. andJ.Wang.2002.A steady state model for graph power laws.In2nd International Workshop on Web Dynamics Honolulu HI. Available at:http:\/\/www.dcs.bbk.ac.uk\/webDyn2\/onlineProceedings.html. [Accessed March 10 2014]."},{"key":"e_1_2_8_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.05.004"},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"e_1_2_8_12_1","unstructured":"Galstyan A. B.Krishnamachari andK.Lerman.2004.Resource allocation and emergent coordination in wireless sensor networks.InAAAI Workshop on Sensor Networks San Jose CA. Available at:http:\/\/www.isi.edu\/~galstyan\/papers\/wsn\u2010RA.pdf. [Accessed March 10 2014]."},{"key":"e_1_2_8_13_1","doi-asserted-by":"crossref","unstructured":"Gjoka M. M.Kurant C.\u2009T.Butts andA.Markopoulou.2010.Practical recommendations on crawling online social networks.InProceedings of the 29th Conference on Information Communications San Diego CA pp.2498\u20132506.","DOI":"10.1109\/JSAC.2011.111011"},{"key":"e_1_2_8_14_1","unstructured":"Glinton R. P.Scerri andK.Sycara.2010.Exploiting scale invariant dynamics for efficient information propagation in large teams.InProceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: International Foundation for Autonomous Agents and Multiagent Systems Toronto Canada pp.21\u201330."},{"key":"e_1_2_8_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-005-6825-4"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2005.05.019"},{"key":"e_1_2_8_17_1","doi-asserted-by":"crossref","unstructured":"Kempe D. andJ.Kleinberg.2003.Maximizing the spread of influence through a social network.InProceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining Washington DC pp.137\u2013146.","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_8_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/35022643"},{"key":"e_1_2_8_19_1","doi-asserted-by":"crossref","unstructured":"Mundinger J. andJ.\u2009Y.Le Boudec.2006.Reputation in self\u2010organized communication systems and beyond.InProceedings of Workshop on Interdisciplinary Systems Approach in Performance Evaluation and Design of Computer & Communications Systems Pisa Italy. DOI:10.1145\/1190326.1190328.","DOI":"10.1145\/1190326.1190328"},{"key":"e_1_2_8_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_2_8_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.1998.0775"},{"key":"e_1_2_8_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature04131"},{"key":"e_1_2_8_23_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature07601"},{"key":"e_1_2_8_24_1","unstructured":"Ott J. andD.Kutscher.2004.Drive\u2010thru Internet: IEEE 802.11b for \u201cautomobile\u201d users.In23rd Annual Joint Conference of the IEEE Computer and Communications Societies Vol. 1 Hong Kong 362\u2013373."},{"key":"e_1_2_8_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-006-1574-5"},{"issue":"01","key":"e_1_2_8_26_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0269888904000116","article-title":"Trust in multi\u2010agent systems","volume":"19","author":"Ramchurn S. D.","year":"2005","journal-title":"The Knowledge Engineering Review"},{"key":"e_1_2_8_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/0883951049050904509045"},{"key":"e_1_2_8_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30913-7_8"},{"issue":"2","key":"e_1_2_8_29_1","first-page":"3","article-title":"Repage: Reputation and image among limited autonomous partners","volume":"9","author":"Sabater J.","year":"2006","journal-title":"Journal of Artificial Societies and Social Simulation"},{"key":"e_1_2_8_30_1","unstructured":"Sen Q.2008.Scale\u2010free topology structure in ad hoc networks.InProceedings of the 11th IEEE International Conference on Communication Technology Hangzhou China pp.21\u201324."},{"key":"e_1_2_8_31_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspb.2008.0762"},{"key":"e_1_2_8_32_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0704598104"},{"key":"e_1_2_8_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCAS.2003.1228503"},{"key":"e_1_2_8_34_1","doi-asserted-by":"crossref","unstructured":"Zhou R. andK.Hwang.2007.Gossip\u2010based reputation aggregation for unstructured peer\u2010to\u2010peer networks.IEEE International Parallel and Distributed Processing Symposium Long Beach CA pp.1\u201310.","DOI":"10.1109\/IPDPS.2007.370285"}],"container-title":["Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fcoin.12036","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/coin.12036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T23:36:17Z","timestamp":1696289777000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/coin.12036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,18]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["10.1111\/coin.12036"],"URL":"https:\/\/doi.org\/10.1111\/coin.12036","archive":["Portico"],"relation":{},"ISSN":["0824-7935","1467-8640"],"issn-type":[{"value":"0824-7935","type":"print"},{"value":"1467-8640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,18]]}}}