This paper examines the decentralized recognition of groups within a multiagent normative society. In this work we explore different mechanisms that allow agents to recognize the others as members of a certain social group. Considering as the basic mechanism the one that makes agents interact with other agents without considering the previous interactions and with no communication, three new algorithms have been developed and tested to improve the efficiency of the basic one. These algorithms are: (1) the whitelisting, (2) the blacklisting, and (3) the labelling algorithm. Moreover, a reinterpretation of the definition of group is done in order to make it more dynamic and flexible with respect to the environment where agents are located. Analysis on simulation results confirms the effectiveness of this dynamic member evaluation function.
Links:
[1] http://www.iiia.csic.es/en/individual/daniel-villatoro
[2] http://www.iiia.csic.es/en/individual/jordi-sabater-mir
[3] http://www.iiia.csic.es/en/publications/export/tagged/3492
[4] http://www.iiia.csic.es/en/publications/export/xml/3492
[5] http://www.iiia.csic.es/en/publications/export/bib/3492
[6] http://www.iiia.csic.es/en/project/at
[7] http://www.iiia.csic.es/en/project/macnorms-0