{"title":"激励相容的声誉机制","authors":"R. Jurca, B. Faltings","doi":"10.1109/COEC.2003.1210263","DOIUrl":null,"url":null,"abstract":"Traditional centralized approaches to security are difficult to apply to large, distributed marketplaces in which software agents operate. Developing a notion of trust that is based on the reputation of agents can provide a softer notion of security that is sufficient for many multi-agent applications. We address the issue of incentive-compatibility (i.e. how to make it optimal for agents to share reputation information truthfully), by introducing a side-payment scheme, organized through a set of broker agents, that makes it rational for software agents to truthfully share the reputation information they have acquired in their past experience. We also show how to use a cryptographic mechanism to protect the integrity of reputation information and to achieve a tight bounding between the identity and reputation of an agent.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"250 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"257","resultStr":"{\"title\":\"An incentive compatible reputation mechanism\",\"authors\":\"R. Jurca, B. Faltings\",\"doi\":\"10.1109/COEC.2003.1210263\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional centralized approaches to security are difficult to apply to large, distributed marketplaces in which software agents operate. Developing a notion of trust that is based on the reputation of agents can provide a softer notion of security that is sufficient for many multi-agent applications. We address the issue of incentive-compatibility (i.e. how to make it optimal for agents to share reputation information truthfully), by introducing a side-payment scheme, organized through a set of broker agents, that makes it rational for software agents to truthfully share the reputation information they have acquired in their past experience. We also show how to use a cryptographic mechanism to protect the integrity of reputation information and to achieve a tight bounding between the identity and reputation of an agent.\",\"PeriodicalId\":375124,\"journal\":{\"name\":\"EEE International Conference on E-Commerce, 2003. CEC 2003.\",\"volume\":\"250 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"257\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EEE International Conference on E-Commerce, 2003. CEC 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COEC.2003.1210263\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EEE International Conference on E-Commerce, 2003. CEC 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COEC.2003.1210263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Traditional centralized approaches to security are difficult to apply to large, distributed marketplaces in which software agents operate. Developing a notion of trust that is based on the reputation of agents can provide a softer notion of security that is sufficient for many multi-agent applications. We address the issue of incentive-compatibility (i.e. how to make it optimal for agents to share reputation information truthfully), by introducing a side-payment scheme, organized through a set of broker agents, that makes it rational for software agents to truthfully share the reputation information they have acquired in their past experience. We also show how to use a cryptographic mechanism to protect the integrity of reputation information and to achieve a tight bounding between the identity and reputation of an agent.