The problem of calculating a degree of reputation for agents acting as assistants to the members of an electronic community is discussed and a solution presented. Usual reputation mechanisms rely on feedback after interaction between agents. An alternative way to establish reputation is related with the position of each member of a community within the corresponding social network. We propose a method based on this idea, which is also used by well-known ranking algorithms, discuss its properties as well as experimental results and compare them to other reputation mechanisms for electronic communities supported by agents. The method proposed uses only local information in order to extract reputation and it is able to adapt automatically to the topology of the network or graph.

The problem of calculating a degree of reputation for agents acting as assistants to the members of an electronic community is discussed and a solution presented. Usual reputation mechanisms rely on feedback after interaction between agents. An alternative way to establish reputation is related with the position of each member of a community within the corresponding social network. We propose a method based on this idea, which is also used by well-known ranking algorithms, discuss its properties as well as experimental results and compare them to other reputation mechanisms for electronic communities supported by agents. The method proposed uses only local information in order to extract reputation and it is able to adapt automatically to the topology of the network or graph.

No abstract

No abstract

No abstract