ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Group organization algorithm based on trust and reputation in agent society
Full text PdfPdf (135 KB)
Source International Conference on Mobile Computing and Multimedia archive
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia table of contents
Linz, Austria
WORKSHOP SESSION: TwUC 2008 table of contents
Pages: 387-390  
Year of Publication: 2008
ISBN:978-1-60558-269-6
Authors
Minsoo Kim  Ajou University, Suwon, South Korea
Minkoo Kim  Ajou University, Suwon, South Korea
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 55,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1497185.1497268
What is a DOI?

ABSTRACT

In cooperation systems such as Multi-Agent Systems, it is an important problem how group of agents is organized as well as how agents cooperate with each other. Moreover, dynamic computing environments require the dynamic organization to the cooperation systems. To this end, in this paper, we propose two organization algorithms based on trust and reputation of agents; one is a centralized and another is a distributed self-organization algorithm.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
4
 
5
6
 
7
D. Huynh, N. R. Jennings, N. R. Shadbolt, "FIRE: Developing an Integrated Trust and Reputation Model for Open Multi-Agent Systems," In Proc. of 16th ECAI, pp. 18--22, 2004
 
8
Wooldridge, M., Jennings N. R. Intelligent agents: Theory and practice. Knowledge Engineering Review 10(2), Cambridge University Press (1995)
 
9
 
10
11