{"title":"A multi-agent testbed for diverse seamless personal information networking applications","authors":"S. Abu-Hakima, R. Liscano, R. Impey","doi":"10.1109/ICMAS.1998.699223","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699223","url":null,"abstract":"The paper describes the design and ongoing implementation of a unique cooperative agent testbed in an environment that addresses diverse applications in seamless personal information networking (SPIN). The real world SPIN testbed is aimed at two difficult problems, namely seamless messaging and intelligent network management. Both applications are agent driven and share agent behaviours.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125314495","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}
{"title":"Distributed constraint satisfaction algorithm for complex local problems","authors":"M. Yokoo, K. Hirayama","doi":"10.1109/ICMAS.1998.699222","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699222","url":null,"abstract":"A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable these algorithms to handle multiple local variables, obtained algorithms are neither efficient nor scalable to larger problems. We develop a new algorithm that can handle multiple local variables efficiently, which is based on the asynchronous weak-commitment search algorithm. In this algorithm, a bad local solution can be modified without forcing other agents to exhaustively search local problems. Also, the number of interactions among agents can be decreased since agents communicate only when they find local solutions that satisfy all of the local constraints. Experimental evaluations show that this algorithm is far more efficient than an algorithm that uses the prioritization among agents.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126218800","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}
{"title":"Modeling adaptive organizations","authors":"Rémy Foisel, V. Chevrier, J. Haton","doi":"10.1109/ICMAS.1998.699246","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699246","url":null,"abstract":"We present a model based on the notion of interaction to build adaptive organizations. Interaction models are used to provide an initial organizational structure to the system. Local assessment capacities are added to make agents adapt the structure according to their requirements. This model is used to build a multi-agent system with global coherent behavior through the use of organizational structure and with abilities to make the system adapt its structure when it is not locally convenient.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116628793","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}
{"title":"A new approach to class formation in multi-agent simulations of language evolution","authors":"F. Kaplan","doi":"10.1109/ICMAS.1998.699045","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699045","url":null,"abstract":"Multi-agent models of language evolution usually involve agents giving names to internal independently constructed categories. We present an approach in which the creation of categories is part of the language formation process itself. When an agent does not have a word for a particular object it is allowed to use the existing name of another object, close to the original one as defined by an analogy function. In this way, the names in the shared lexicon that has evolved in a collective way, directly yield the different object classes. We present the results of several simulations using this model showing under what conditions the agents will develop meaningful classes. We also examine the effects of an influx and outflux of agents. Finally we discuss the prospects for models in which the classes would constitute relevant complex taxonomies.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131028602","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}
{"title":"Social simulation, agents and artificial societies","authors":"J. Doran","doi":"10.1109/ICMAS.1998.699021","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699021","url":null,"abstract":"Computer simulation in support of the social sciences is far from new. But, with one or two exceptions, notably certain types of economic modeling, it has never become a major weapon in the social scientists armoury. However, in the last few years developments in intelligent agents and multiple agent systems have sparked a new interest in computer simulation in disciplines such as economics, anthropology and sociology. The key new opportunity is that something corresponding to the cognitive processes of members of a society may now be made explicit (in agents) in models. This enables studies to be made of the relationship between agent-level and society-level phenomena in a way not previously possible. However, important and interesting methodological difficulties arise, and it is these difficulties that are the main focus of the paper.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"475 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133472792","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}
{"title":"Cooperative uncertain temporal reasoning for distributed transportation scheduling","authors":"M. Bouzid, A. Mouaddib","doi":"10.1109/ICMAS.1998.699231","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699231","url":null,"abstract":"Transportation scheduling application consists of distributed transportation companies that have to carry out transportation orders which arrive dynamically. Each company has a set of trucks at their disposal. Each company should maximize the satisfaction of orders according to the availability of its trucks. The distributed AI approach is suitable for this application because of: first the complexity of a centralized scheduling algorithm and second the distributed nature of the application (companies and trucks are geographically distributed). Furthermore, the task of transportation is characterized by a high level of uncertainty regarding different factors such as the traffic density, the power of the truck used and soon that cannot be ignored. We present a suitable temporal representation of trucks taking the uncertainty of their availability into account by using the Fuzzy Characteristics Functions and an Extended Contract Net Protocol based on this representation to negotiate the delegation of orders from one company to another one.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129072641","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}
{"title":"Industrial applications of multi-agent technology","authors":"Donald Steiner","doi":"10.1109/ICMAS.1998.699025","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699025","url":null,"abstract":"One of the key advantages of multi-agent technology is the support it offers in integrating and coordinating heterogeneous systems in a distributed and open environment. This advantage is increasingly being put to use in industrial environments, in particular, where components are provided by different companies or groups. However, in order to effectively make use of this advantage, standards are required to guide the way in which agents interact and are managed. For this purpose, the Foundation for Intelligent Physical Agents (FIPA) was established, which released its first specification, FIPA 97, in October, 1997. The paper presents an overview of the FIPA agent standardisation activities as well as the industrial field trials making use of the FIPA 97 specifications.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"338 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115423217","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}
{"title":"Selfish memes and selfless agents-altruism in the swap shop","authors":"David Hales","doi":"10.1109/ICMAS.1998.699248","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699248","url":null,"abstract":"A memetic approach is applied to a resource sharing scenario. Agents are represented as cells on a grid applying simple cultural learning rules which selectively replicate and repel memes from neighbours. The memes represent culturally learned traits but also influence resource sharing behaviours. In the experiments presented, multiple cultural groupings which become altruistic towards \"in-group\" members emerge via a form of group selection. It is demonstrated that such methods can produce more optimal societies than conventional evolutionary methods in given situations. The memetic approach is inherently distributed and dynamic, offering the possibility of application to areas such as collective robotics and software agent co-ordination.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124842394","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}
{"title":"Mixing and memory: emergent cooperation in an information marketplace","authors":"Aaron A. Armstrong, E. Durfee","doi":"10.1109/ICMAS.1998.699029","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699029","url":null,"abstract":"An information marketplace consists of a group of agents buying and selling information content and services. Self-interested agents may find it rational to cheat others in the market. The authors have modeled federations of digital libraries selling information to one another. In the model, cooperation emerges through endogenous incentives. They had hypothesized that a number of factors would encourage cooperation: greater familiarity with trading partners, more memory for modeling others, fewer initially misbehaving agents, lower rates of strategy exploration, smaller world sizes, and more rapidly evolving measures of the likelihood of other agents to cooperate. The simulations confirmed many of the hypotheses. However the benefits of a small world size are dependent on memory size, and the usefulness of rapidly evolving estimates of cooperation is dependent on the types of strategies employed by the agents. They suggest that it will become increasingly important to allow agents conceptually to carve their networked environment into subcommunities where familiarity and trust can emerge, as opposed to promoting indiscriminate interactions within a large society of digital agents.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124492619","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}
{"title":"An interaction-based model for situated agents","authors":"B. Bouzy","doi":"10.1109/ICMAS.1998.699232","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699232","url":null,"abstract":"The paper enriches the current studies on interaction with a domain where agents have original properties about the interaction. The agents interact with the external world and the agent-world interactions enable the model to recognise the approximate state of the agents. They interact between each other and the agent-agent interactions refine their state. This model has been implemented with success in Indigo, a Go playing program.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"248 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123152902","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}