Pub Date : 2004-09-20DOI: 10.1109/IAT.2004.1342978
A. Suna, G. Klein, A. E. Seghrouchni
From the recent improvements in network and peer-to-peer technologies and the ever-growing needs for computer power, new ways of sharing resources between users have emerged. However, these new technologies allow only centralized calculus-sharing, even if they already offer "peer-to-peer" sharing of data. This work presents a method based on multi-agent systems which allow load-sharing between distant users.
{"title":"Using mobile agents for resource sharing","authors":"A. Suna, G. Klein, A. E. Seghrouchni","doi":"10.1109/IAT.2004.1342978","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342978","url":null,"abstract":"From the recent improvements in network and peer-to-peer technologies and the ever-growing needs for computer power, new ways of sharing resources between users have emerged. However, these new technologies allow only centralized calculus-sharing, even if they already offer \"peer-to-peer\" sharing of data. This work presents a method based on multi-agent systems which allow load-sharing between distant users.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"45 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":"125619655","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.1343001
G. Boella, Leendert van der Torre
A theory of rational decision making in normative multi-agent systems has to distinguish among the many reasons why agents fulfill or violate obligations. We propose a classification of such reasons for single cognitive agent decision making in a single normative system, based on the increasing complexity of this agent. In the first class we only consider the agent's motivations, in the second class we consider also its abilities, in the third class we consider also its beliefs, and finally we consider also sensing actions to observe the environment. We sketch how the reasons can be formalized in a normative multiagent system with increasingly complex cognitive agents.
{"title":"Fulfilling or violating obligations in normative multiagent systems","authors":"G. Boella, Leendert van der Torre","doi":"10.1109/IAT.2004.1343001","DOIUrl":"https://doi.org/10.1109/IAT.2004.1343001","url":null,"abstract":"A theory of rational decision making in normative multi-agent systems has to distinguish among the many reasons why agents fulfill or violate obligations. We propose a classification of such reasons for single cognitive agent decision making in a single normative system, based on the increasing complexity of this agent. In the first class we only consider the agent's motivations, in the second class we consider also its abilities, in the third class we consider also its beliefs, and finally we consider also sensing actions to observe the environment. We sketch how the reasons can be formalized in a normative multiagent system with increasingly complex cognitive agents.","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":"126111989","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.1343006
G. Boella, Leendert van der Torre
We formalize the specification of games in the trias politico using Rao and Georgeff's specification language BDI/sub CTL*/. In particular, we generalize Rao and Georgeff's specification of single agent decision trees to multiagent games, for which we introduce observations and recursive modelling, in this setting we formalize obligations, and we characterize four kinds of agents, called legislators, judges, policemen and citizens. Legislators are characterized by their power to create and revise obligations, judges are characterized by their power to count behavior of citizens as violations, and policemen are characterized by their ability to sanction behavior.
{"title":"Game specification in normative multiagent system: the trias politica","authors":"G. Boella, Leendert van der Torre","doi":"10.1109/IAT.2004.1343006","DOIUrl":"https://doi.org/10.1109/IAT.2004.1343006","url":null,"abstract":"We formalize the specification of games in the trias politico using Rao and Georgeff's specification language BDI/sub CTL*/. In particular, we generalize Rao and Georgeff's specification of single agent decision trees to multiagent games, for which we introduce observations and recursive modelling, in this setting we formalize obligations, and we characterize four kinds of agents, called legislators, judges, policemen and citizens. Legislators are characterized by their power to create and revise obligations, judges are characterized by their power to count behavior of citizens as violations, and policemen are characterized by their ability to sanction behavior.","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":"124635428","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.1342983
B. Stahmer, A. Schwaiger
Data mining global models of complex domains is often difficult - a lot of methods are NP-hard as stated in D. M. Chickering et al. (1994) - and the resulting models either lack of details or are far too complex to work with them. In our case we were challenged with the task to model the shopping behavior of customers and the sales behaviour of items within a real supermarket store in order to forecast product sales figures on the basis of 'what-if'-scenarios. To forecast the scenarios we represent and simulate all entities of a store as holonic probabilistic agents. The knowledge bases of the agents consist of behavior networks which are data mined from real store data. For simulation we integrate on demand global coherences in our models without loosing the level of detail. This is realized by a process where the agents merge to a so called holon. We present an algorithm to merge the agents' behaviour networks where global coherences between the behaviors of different agents evolve as an effect of emergence.
对复杂领域的全局模型进行数据挖掘通常是困难的——正如D. M. Chickering等人(1994)所述，许多方法都是np困难的——所得到的模型要么缺乏细节，要么太复杂而无法使用它们。在我们的案例中，我们面临的挑战是模拟顾客的购物行为和真实超市中商品的销售行为，以便在“假设”情景的基础上预测产品销售数字。为了预测场景，我们将商店的所有实体表示和模拟为全息概率代理。智能体的知识库由行为网络组成，这些行为网络是从实际商店数据中挖掘出来的数据。对于模拟，我们在模型中按需集成全局一致性，而不会丢失细节级别。这是通过一个过程来实现的，在这个过程中，代理合并到一个所谓的holon。我们提出了一种算法来合并代理的行为网络，其中不同代理的行为之间的全局一致性作为涌现效应而进化。
{"title":"Holonic probabilistic agent merging algorithm","authors":"B. Stahmer, A. Schwaiger","doi":"10.1109/IAT.2004.1342983","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342983","url":null,"abstract":"Data mining global models of complex domains is often difficult - a lot of methods are NP-hard as stated in D. M. Chickering et al. (1994) - and the resulting models either lack of details or are far too complex to work with them. In our case we were challenged with the task to model the shopping behavior of customers and the sales behaviour of items within a real supermarket store in order to forecast product sales figures on the basis of 'what-if'-scenarios. To forecast the scenarios we represent and simulate all entities of a store as holonic probabilistic agents. The knowledge bases of the agents consist of behavior networks which are data mined from real store data. For simulation we integrate on demand global coherences in our models without loosing the level of detail. This is realized by a process where the agents merge to a so called holon. We present an algorithm to merge the agents' behaviour networks where global coherences between the behaviors of different agents evolve as an effect of emergence.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"63 2 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":"131101755","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.1342937
Xiao-hua Xu, Ling Chen, Ping He
Based on the principle of cellular automata in artificial life, an artificial ant sleeping model (ASM) and an ant algorithm for cluster analysis (A4C) are presented. Inspired by the behaviors of gregarious ant colonies, we use the ant agent to represent a data object. In ASM, each ant has two states: a sleeping state and an active state. The ant's state is controlled by a function of the ant's fitness to the environment it locates and a probability for the ants becoming active. The state of an ant is determined only by its local information. By moving dynamically, the ants form different subgroups adaptively, and hence the data objects they represent are clustered. Experimental results show that the A4C algorithm on ASM is significantly better than other clustering methods in terms of both speed and quality. It is adaptive, robust and efficient, achieving high autonomy, simplicity and efficiency.
{"title":"A novel ant clustering algorithm based on cellular automata","authors":"Xiao-hua Xu, Ling Chen, Ping He","doi":"10.1109/IAT.2004.1342937","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342937","url":null,"abstract":"Based on the principle of cellular automata in artificial life, an artificial ant sleeping model (ASM) and an ant algorithm for cluster analysis (A4C) are presented. Inspired by the behaviors of gregarious ant colonies, we use the ant agent to represent a data object. In ASM, each ant has two states: a sleeping state and an active state. The ant's state is controlled by a function of the ant's fitness to the environment it locates and a probability for the ants becoming active. The state of an ant is determined only by its local information. By moving dynamically, the ants form different subgroups adaptively, and hence the data objects they represent are clustered. Experimental results show that the A4C algorithm on ASM is significantly better than other clustering methods in terms of both speed and quality. It is adaptive, robust and efficient, achieving high autonomy, simplicity and efficiency.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"98 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":"131990817","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.1343005
Marcos Antonio de Oliveira, M. Purvis, Stephen Cranefield, M. Nowostawski
The management of interactions among agents in an open multiagent system demands a robust organization mechanism to take care of the entire interaction process. The use of institutional norms to facilitate the guidance of a multiagent society is one well-founded approach to implement organized agent interactions. This work presents a distributed model to organize agent interoperations, using institutions as the main management element, and commitments between agents as a way to model interactions among agents and promote organized multiagent societies.
{"title":"Institutions and commitments in open multi-agent systems","authors":"Marcos Antonio de Oliveira, M. Purvis, Stephen Cranefield, M. Nowostawski","doi":"10.1109/IAT.2004.1343005","DOIUrl":"https://doi.org/10.1109/IAT.2004.1343005","url":null,"abstract":"The management of interactions among agents in an open multiagent system demands a robust organization mechanism to take care of the entire interaction process. The use of institutional norms to facilitate the guidance of a multiagent society is one well-founded approach to implement organized agent interactions. This work presents a distributed model to organize agent interoperations, using institutions as the main management element, and commitments between agents as a way to model interactions among agents and promote organized multiagent societies.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"24 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":"132486204","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.1342927
G. Jayaputera, A. Zaslavsky, S. Loke
We present our approach to developing a multiagent system based on the proposed complex concept of the mission. The mission is a high-level abstraction that combines the overall goal of a system, the means, and the process of achieving that goal, from which agents can be automatically generated. We propose a mechanism to generate agents on-demand and at run-time rather than at the design stage. Functionalities are given to the agents at run-time also. Programmatically, a mission is a live object where it maintains not only the various revisions of the plan but also the state and data for each revision. By doing so, our system is able to suspend and resume the mission. Furthermore, we envisage that the mission execution history is useful for the planner so that it can learn from it and hence produce a better plan in the future. We discuss the concept of the mission object, our programmatic model as well as our prototype system, which we call eHermes.
{"title":"Run-time mission evolution in mobile multiagent systems","authors":"G. Jayaputera, A. Zaslavsky, S. Loke","doi":"10.1109/IAT.2004.1342927","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342927","url":null,"abstract":"We present our approach to developing a multiagent system based on the proposed complex concept of the mission. The mission is a high-level abstraction that combines the overall goal of a system, the means, and the process of achieving that goal, from which agents can be automatically generated. We propose a mechanism to generate agents on-demand and at run-time rather than at the design stage. Functionalities are given to the agents at run-time also. Programmatically, a mission is a live object where it maintains not only the various revisions of the plan but also the state and data for each revision. By doing so, our system is able to suspend and resume the mission. Furthermore, we envisage that the mission execution history is useful for the planner so that it can learn from it and hence produce a better plan in the future. We discuss the concept of the mission object, our programmatic model as well as our prototype system, which we call eHermes.","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":"131338645","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.1343009
Olindo Iglesias, Rita Almeida Ribeiro, J. R. Fonseca
This work formalizes an original bidding model to be applied in complex negotiation scenarios with conflicting interests, involving multiple bidders and a single announcer agent. Agents have preferences, and the bidding model is formalized with a bidding path algorithm applied to the transportation industry. In each negotiation round every bidding agent must put forward a bid that not only meets the satisfaction threshold set by the announcer, but also simultaneously maximizes bidder and announcer satisfaction. On doing so the bidders are walking a bidding path. This work formalizes the bidding path algorithm concept, which is at the core of our bidding model.
{"title":"A fuzzy multi-agent bidding model","authors":"Olindo Iglesias, Rita Almeida Ribeiro, J. R. Fonseca","doi":"10.1109/IAT.2004.1343009","DOIUrl":"https://doi.org/10.1109/IAT.2004.1343009","url":null,"abstract":"This work formalizes an original bidding model to be applied in complex negotiation scenarios with conflicting interests, involving multiple bidders and a single announcer agent. Agents have preferences, and the bidding model is formalized with a bidding path algorithm applied to the transportation industry. In each negotiation round every bidding agent must put forward a bid that not only meets the satisfaction threshold set by the announcer, but also simultaneously maximizes bidder and announcer satisfaction. On doing so the bidders are walking a bidding path. This work formalizes the bidding path algorithm concept, which is at the core of our bidding model.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"293 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114004843","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.1342958
Raymond Y. K. Lau, Maolin Tang, O. Wong
Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile negotiator preferences. Classical negotiation models fail to address most of these issues. This work illustrates our practical negotiation agents which are empowered by an effective and efficient genetic algorithm to deal with complex, incomplete, and dynamic negotiation spaces arising in real-world applications. Initial experiment demonstrates that our genetically optimised adaptive negotiation agents outperform a theoretically optimal negotiation model when time pressure exists. Our research work opens the door to the development of responsive and adaptive negotiation agents for real-world applications.
{"title":"Towards genetically optimised responsive negotiation agents","authors":"Raymond Y. K. Lau, Maolin Tang, O. Wong","doi":"10.1109/IAT.2004.1342958","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342958","url":null,"abstract":"Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile negotiator preferences. Classical negotiation models fail to address most of these issues. This work illustrates our practical negotiation agents which are empowered by an effective and efficient genetic algorithm to deal with complex, incomplete, and dynamic negotiation spaces arising in real-world applications. Initial experiment demonstrates that our genetically optimised adaptive negotiation agents outperform a theoretically optimal negotiation model when time pressure exists. Our research work opens the door to the development of responsive and adaptive negotiation agents for real-world applications.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"40 5 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":"114346681","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.1342948
Satoshi V. Suzuki, S. Yamada
It is important to investigate the influence of life-like agents interacting with a user since some studies suggest thai life-like agents can "persuade" people, in other words, they have potential to change people's attitude and behavior. In this study, the influence of overheard communication (OC), one of famous persuasion techniques, by life-like agents toward online shopping Web site users was examined, since the OC by people often changes attitude of receivers. An experiment to compare the effect of OC by two life-like agents (a persuader agent and a persuadee agent) with regular communication by one persuader agent were conducted. The result of this experiment implied that even the OC by life-like agents could promote Web site users' online shopping purchase likelihood. Moreover, despite impression to a life-like agent as a persuader was not strongly affected by OC, attractiveness toward a persuader agent evaluated by participants was positively correlated with their purchase likelihood. These results suggest the effectiveness of the OC by life-like agents and the new direction of studies of social response to life-like agents, from the viewpoints of presence, gaze, and appearance of lifelike agents.
{"title":"Persuasion through overheard communication by life-like agents","authors":"Satoshi V. Suzuki, S. Yamada","doi":"10.1109/IAT.2004.1342948","DOIUrl":"https://doi.org/10.1109/IAT.2004.1342948","url":null,"abstract":"It is important to investigate the influence of life-like agents interacting with a user since some studies suggest thai life-like agents can \"persuade\" people, in other words, they have potential to change people's attitude and behavior. In this study, the influence of overheard communication (OC), one of famous persuasion techniques, by life-like agents toward online shopping Web site users was examined, since the OC by people often changes attitude of receivers. An experiment to compare the effect of OC by two life-like agents (a persuader agent and a persuadee agent) with regular communication by one persuader agent were conducted. The result of this experiment implied that even the OC by life-like agents could promote Web site users' online shopping purchase likelihood. Moreover, despite impression to a life-like agent as a persuader was not strongly affected by OC, attractiveness toward a persuader agent evaluated by participants was positively correlated with their purchase likelihood. These results suggest the effectiveness of the OC by life-like agents and the new direction of studies of social response to life-like agents, from the viewpoints of presence, gaze, and appearance of lifelike agents.","PeriodicalId":281008,"journal":{"name":"Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).","volume":"111 2 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":"134095697","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
扫码关注我们
求助内容：
应助结果提醒方式：