Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342938
M. Sims, D. Corkill, V. Lesser
Organizational design and instantiation is the process that accepts a set of organizational goals, performance requirements, agents, and resources and assigns responsibilities and roles to each agent. We present a prescriptive organizational design and instantiation process for multi-agent systems. An important aspect of our approach is the separation of application-specific organizational issues from more generic organizational coordination mechanisms. We describe our model of organizational design and our search process. We also present example organizations generated by our automated system for the distributed sensor network domain under different environmental characteristics and performance requirements.
{"title":"Separating domain and coordination in multi-agent organizational design and instantiation","authors":"M. Sims, D. Corkill, V. Lesser","doi":"10.1109/IAT.2004.1342938","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342938","url":null,"abstract":"Organizational design and instantiation is the process that accepts a set of organizational goals, performance requirements, agents, and resources and assigns responsibilities and roles to each agent. We present a prescriptive organizational design and instantiation process for multi-agent systems. An important aspect of our approach is the separation of application-specific organizational issues from more generic organizational coordination mechanisms. We describe our model of organizational design and our search process. We also present example organizations generated by our automated system for the distributed sensor network domain under different environmental characteristics and performance requirements.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128141129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342963
V. Mashkov
The task of carrying out humanitarian and peacekeeping missions by a high number of hardly collaborating and vaguely linked nongovernmental organizations is a challenging problem. Collaborators, joined by a common goal, group into parties playing an active role in the mission. In the paper we have considered such groups of collaborators as alliance and coalition. On the account of the fact that some of the group members (agents) representing individual organizations may disagree to cooperate (share information and resources) with all the other agents but only with a selected number of them, we introduced the specific type of alliance called "restricted alliance". The paper focuses on the problem of coalition formation (coalition structure) with the agents of restricted alliance. The main attention is paid to the issues of agents' activities at the stage of coalition structuring.
{"title":"Restricted alliance and coalitions formation","authors":"V. Mashkov","doi":"10.1109/IAT.2004.1342963","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342963","url":null,"abstract":"The task of carrying out humanitarian and peacekeeping missions by a high number of hardly collaborating and vaguely linked nongovernmental organizations is a challenging problem. Collaborators, joined by a common goal, group into parties playing an active role in the mission. In the paper we have considered such groups of collaborators as alliance and coalition. On the account of the fact that some of the group members (agents) representing individual organizations may disagree to cooperate (share information and resources) with all the other agents but only with a selected number of them, we introduced the specific type of alliance called \"restricted alliance\". The paper focuses on the problem of coalition formation (coalition structure) with the agents of restricted alliance. The main attention is paid to the issues of agents' activities at the stage of coalition structuring.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133101100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342993
L. K. Wickramasinghe, D. Alahakoon
Intelligent agent technology can be considered as a step towards the next stage of artificial intelligence. This new technology attempts to bridge the gap between man and machine. When bridging the man-machine gap, one of the main issues to address is how to make agents capable of autonomous actions in a dynamic environment. Inspired by human behavior, psychology and brain science, This work presents a layered agent architecture which combines two fundamental forms of adaptation: learning and evolution. Each layer depicts the functionality of a human being making the agent better prepared to face environment dynamisms. The novel feature of the proposed architecture is, it enables the agent to evolve such that, the best action required for a given state of the environment is identified through learning rather than using a pre defined set of actions or plans.
{"title":"Adaptive agent architecture inspired by human behavior","authors":"L. K. Wickramasinghe, D. Alahakoon","doi":"10.1109/IAT.2004.1342993","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342993","url":null,"abstract":"Intelligent agent technology can be considered as a step towards the next stage of artificial intelligence. This new technology attempts to bridge the gap between man and machine. When bridging the man-machine gap, one of the main issues to address is how to make agents capable of autonomous actions in a dynamic environment. Inspired by human behavior, psychology and brain science, This work presents a layered agent architecture which combines two fundamental forms of adaptation: learning and evolution. Each layer depicts the functionality of a human being making the agent better prepared to face environment dynamisms. The novel feature of the proposed architecture is, it enables the agent to evolve such that, the best action required for a given state of the environment is identified through learning rather than using a pre defined set of actions or plans.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132117951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342934
Chongming Hou
This work presents a learning mechanism that applies nonlinear regression analysis to predict a negotiation agent's behaviour based only the opponent's previous offers. The behaviour of negotiation agents in this study is determined by their tactics in the form of decision functions. Heuristics based on estimates of an agent's tactics are drawn from a series of experiments. The findings of this empirical study show that this approach can be used to obtain better deals than existing decision function tactics. The learning mechanism can be used online, without any prior knowledge about other agents and is therefore, very useful in open systems where agents have little or no information about each other.
{"title":"Predicting agents tactics in automated negotiation","authors":"Chongming Hou","doi":"10.1109/IAT.2004.1342934","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342934","url":null,"abstract":"This work presents a learning mechanism that applies nonlinear regression analysis to predict a negotiation agent's behaviour based only the opponent's previous offers. The behaviour of negotiation agents in this study is determined by their tactics in the form of decision functions. Heuristics based on estimates of an agent's tactics are drawn from a series of experiments. The findings of this empirical study show that this approach can be used to obtain better deals than existing decision function tactics. The learning mechanism can be used online, without any prior knowledge about other agents and is therefore, very useful in open systems where agents have little or no information about each other.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122867345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342987
Abdul-Rahman Mawlood-Yunis, A. Nayak, D. Nussbaum, N. Santoro
We study the performance behavior of two mobile agent platforms (AGLET and TACOMA) in distributed search. The search problem is analyzed from two different standpoints: the single agent search and multiple agents search. Several experimental were carried out to measure the performance of mobile agent's solution to distributed search problem under variable network size, network topology and number of agents. The results indicate that the two mobile agent platforms have similar behavior but their performance varies with underling implementation, and the multiple agents approach performs better than the single agent approach in large networks.
{"title":"Comparing performance of two mobile agent platforms in distributed search","authors":"Abdul-Rahman Mawlood-Yunis, A. Nayak, D. Nussbaum, N. Santoro","doi":"10.1109/IAT.2004.1342987","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342987","url":null,"abstract":"We study the performance behavior of two mobile agent platforms (AGLET and TACOMA) in distributed search. The search problem is analyzed from two different standpoints: the single agent search and multiple agents search. Several experimental were carried out to measure the performance of mobile agent's solution to distributed search problem under variable network size, network topology and number of agents. The results indicate that the two mobile agent platforms have similar behavior but their performance varies with underling implementation, and the multiple agents approach performs better than the single agent approach in large networks.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122977292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342981
W. Cheah, S. Loke, S. Krishnaswamy, Sea Ling
Ideas from argumentation-based negotiation can be incorporated into human-agent interaction (HAI) to increase the flexibility of a system and allow greater user control. However, this can increase the complexity of system design and implementation. This work discusses the use of mobile agents in mediating the interaction between people, and between people and a system, including resolving conflicts through negotiation in a flexible and user controllable manner. This work also discusses the issues and design principles for argumentation-based negotiation in HAI in the context of a flexible smart room booking system.
{"title":"Adding flexibility to a room booking system using argumentation-inspired negotiations as mediated by mobile agents","authors":"W. Cheah, S. Loke, S. Krishnaswamy, Sea Ling","doi":"10.1109/IAT.2004.1342981","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342981","url":null,"abstract":"Ideas from argumentation-based negotiation can be incorporated into human-agent interaction (HAI) to increase the flexibility of a system and allow greater user control. However, this can increase the complexity of system design and implementation. This work discusses the use of mobile agents in mediating the interaction between people, and between people and a system, including resolving conflicts through negotiation in a flexible and user controllable manner. This work also discusses the issues and design principles for argumentation-based negotiation in HAI in the context of a flexible smart room booking system.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123024657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342968
J. A. Blaya, P. M. Ruiz, A. Gómez-Skarmeta
This work is focused in the proposal of a new approach based on intelligent agents for the initiation, control and adaptation of a multimedia session. Typically, multimedia sessions are managed through the SIP (session initiation protocol) Internet protocol. When the session is negotiated, very little is said at the SIP specification about how to decide on which configuration, among the possible ones, is the most suitable for the agents playing the protocol interaction. We propose a negotiation mechanism based on the monotonic concession protocol to obtain an optimal joint utility for both peers.
{"title":"User-aware videoconference session control using software agents","authors":"J. A. Blaya, P. M. Ruiz, A. Gómez-Skarmeta","doi":"10.1109/IAT.2004.1342968","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342968","url":null,"abstract":"This work is focused in the proposal of a new approach based on intelligent agents for the initiation, control and adaptation of a multimedia session. Typically, multimedia sessions are managed through the SIP (session initiation protocol) Internet protocol. When the session is negotiated, very little is said at the SIP specification about how to decide on which configuration, among the possible ones, is the most suitable for the agents playing the protocol interaction. We propose a negotiation mechanism based on the monotonic concession protocol to obtain an optimal joint utility for both peers.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128621378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342941
E. Bitting, A. Ghorbani
The risks and benefits of trusting others in a cooperative context is discussed and the notion of social rationality is used to establish these ideas in the realm of autonomous rational agents (utility maximizers). A traffic simulation is introduced to test the ideas presented in this work. The simulation consists of traffic lights controlled by cooperative autonomous agents, each of whom is given mechanisms to implement social rationality. Results using cooperative traffic agents are compared to results of control simulations where non-cooperative agents were deployed. Results predictably show a loss of local efficiency and a gain of global efficiency with the cooperative agents in comparison to their non-cooperative counterparts.
{"title":"Cooperative multiagent systems for the optimization of urban traffic","authors":"E. Bitting, A. Ghorbani","doi":"10.1109/IAT.2004.1342941","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342941","url":null,"abstract":"The risks and benefits of trusting others in a cooperative context is discussed and the notion of social rationality is used to establish these ideas in the realm of autonomous rational agents (utility maximizers). A traffic simulation is introduced to test the ideas presented in this work. The simulation consists of traffic lights controlled by cooperative autonomous agents, each of whom is given mechanisms to implement social rationality. Results using cooperative traffic agents are compared to results of control simulations where non-cooperative agents were deployed. Results predictably show a loss of local efficiency and a gain of global efficiency with the cooperative agents in comparison to their non-cooperative counterparts.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129097105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1343013
M. Huget, Y. Demazeau
The adoption of multiagent systems by companies and users requires that it is possible to verify the properties of the multiagent systems. The main candidate of this verification is model checking but as sketched in the paper, it presents drawbacks such as combinatorial explosion or it does not take the environment into account. Model checking seems to be restricted to small systems with few agents. We present a different approach used in testing called the record/replay mechanism. We add as well a post-mortem analysis. This work describes the advantages of this approach and how we have implemented it in the MadKit platform.
{"title":"Evaluating multiagent systems: a record/replay approach","authors":"M. Huget, Y. Demazeau","doi":"10.1109/IAT.2004.1343013","DOIUrl":"https://doi.org/10.1109/IAT.2004.1343013","url":null,"abstract":"The adoption of multiagent systems by companies and users requires that it is possible to verify the properties of the multiagent systems. The main candidate of this verification is model checking but as sketched in the paper, it presents drawbacks such as combinatorial explosion or it does not take the environment into account. Model checking seems to be restricted to small systems with few agents. We present a different approach used in testing called the record/replay mechanism. We add as well a post-mortem analysis. This work describes the advantages of this approach and how we have implemented it in the MadKit platform.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117085188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342979
Myeong-Wuk Jang, A. Ahmed, G. Agha
An important problem for agents in open multiagent systems is how to find agents that match certain criteria. A number of middle agent services - such as matchmaking and brokering services - have been proposed to address this problem. However, the search capabilities of such services are relatively limited since the match criteria they use are relatively inflexible. We propose ATSpace, a model to support application-oriented matchmaking and brokering services. Application agents in ATSpace deliver their own search algorithms to a public tuple space which holds agent property data; the tuple space executes the search algorithms on this data. We show how the ATSpace model increases the dynamicity and flexibility of a middle agent service. Unfortunately, the model also introduces security threats: the data and access control restrictions in ATSpace may be compromised, and system availability may be affected. We describe some mechanisms to address these security threats.
{"title":"ATSpace: a middle agent to support application oriented matchmaking and brokering services","authors":"Myeong-Wuk Jang, A. Ahmed, G. Agha","doi":"10.1109/IAT.2004.1342979","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342979","url":null,"abstract":"An important problem for agents in open multiagent systems is how to find agents that match certain criteria. A number of middle agent services - such as matchmaking and brokering services - have been proposed to address this problem. However, the search capabilities of such services are relatively limited since the match criteria they use are relatively inflexible. We propose ATSpace, a model to support application-oriented matchmaking and brokering services. Application agents in ATSpace deliver their own search algorithms to a public tuple space which holds agent property data; the tuple space executes the search algorithms on this data. We show how the ATSpace model increases the dynamicity and flexibility of a middle agent service. Unfortunately, the model also introduces security threats: the data and access control restrictions in ATSpace may be compromised, and system availability may be affected. We describe some mechanisms to address these security threats.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114606951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：