Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)最新文献

筛选
英文 中文
Partial plan recognition with incomplete information 不完全信息下的部分计划识别
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699278
J. J. Lee, R. McCartney
{"title":"Partial plan recognition with incomplete information","authors":"J. J. Lee, R. McCartney","doi":"10.1109/ICMAS.1998.699278","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699278","url":null,"abstract":"Explores the benefits of using user models for plan recognition problems in a real-world application. Self-interested agents are designed for the prediction of resource usage in the UNIX domain using a stochastic approach to automatically acquire regularities of user behavior. Both sequential information from the command sequence and relational information such as system's responses and arguments to the commands are considered to typify a user's behavior and intentions. Issues of ambiguity, distraction and interleaved execution of user behavior are examined and taken into account to improve the probability estimation in hidden Markov models.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"41 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":"129965909","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}
引用次数: 4
Designing bidding strategies for trading agents in electronic auctions 电子拍卖中交易代理的竞价策略设计
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699042
E. Giménez-Funes, L. Godo, J. Rodríguez-Aguilar, P. Garcia-Calvés
{"title":"Designing bidding strategies for trading agents in electronic auctions","authors":"E. Giménez-Funes, L. Godo, J. Rodríguez-Aguilar, P. Garcia-Calvés","doi":"10.1109/ICMAS.1998.699042","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699042","url":null,"abstract":"Auction-based electronic commerce is an increasingly interesting domain for developing trading agents. In this paper we present our first contributions towards the construction of such agents by introducing both a formal and a more pragmatical approach for the design of bidding strategies that provide buyer agents with useful heuristic guidelines to participate in auction-based tournaments. On the one hand, our formal view relies on possibilistic-based decision theory as the means of handling possibilistic uncertainty on the consequences of actions due to the lack of knowledge about the other agents' behaviour. On the other hand for practical reasons we also propose a two-fold method for decision making that does not require the evaluation of the whole set of alternative actions. This approach utilizes global (market-centered) probabilistic information in a first decision step which is subsequently refined by a second decision step based on the individual (rival-centered) possibilistic information induced from the memory of cases composing the history of tournaments. In this way, the resulting bidding strategy balances the agent's short-term benefits, related to the probabilistic information, with its long-term benefits, related to the possibilistic information.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"36 5 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":"127655361","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}
引用次数: 66
Using user models in software agents: the Virtual Secretary 软件代理中使用用户模型:虚拟秘书
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699228
J. G. Bellika, G. Hartvigsen, R. A. Widding
{"title":"Using user models in software agents: the Virtual Secretary","authors":"J. G. Bellika, G. Hartvigsen, R. A. Widding","doi":"10.1109/ICMAS.1998.699228","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699228","url":null,"abstract":"A user model contains knowledge of the user's past and present tasks and it is the key element in the construction of adaptive user interfaces. A less discovered feature of user models is their potential use in software agents. Through the transference of user models, we can construct software agents that both reduce the threats of software agents penetrating a local host and the amount of data transferred. The paper presents the Virtual Secretary, which is a user model based software agent system.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"40 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":"121171597","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}
引用次数: 7
A multiagent robot language for communication and concurrency control 用于通信和并发控制的多智能体机器人语言
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699051
Hiroyuki Nishiyama, H. Ohwada, F. Mizoguchi
{"title":"A multiagent robot language for communication and concurrency control","authors":"Hiroyuki Nishiyama, H. Ohwada, F. Mizoguchi","doi":"10.1109/ICMAS.1998.699051","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699051","url":null,"abstract":"The paper presents a programming language, Multiagent Robot Language (MRL), for communication with and control of robotic agents, including physical robots and sensors. While robotic agents can perform their own tasks, task level cooperation allows them to perform more complex tasks that cannot be achieved by a single robot. MRL provides an integrated framework for concurrency control, emergent event handling, and negotiation of distributed robotic agents in a declarative manner. MRL is an executable specification language for multiagent robot control, since MRL programs are transformed into a set of guarded Horn clauses (parallel logic programs running on parallel computers). This feature provides both low and semantic level distributed control to enable intelligent cooperation between physical agents; this new approach incorporates concurrent control facilities into distributed AI and agent oriented programming systems.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"15 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":"131165643","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}
引用次数: 26
Towards multi-swarm problem solving in networks 网络中多群问题的求解
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699217
T. White, B. Pagurek
{"title":"Towards multi-swarm problem solving in networks","authors":"T. White, B. Pagurek","doi":"10.1109/ICMAS.1998.699217","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699217","url":null,"abstract":"This paper describes how multiple interacting swarms of adaptive mobile agents can be used to solve problems in networks. The paper introduces a new architectural description for an agent that is chemically inspired and proposes chemical interaction as the principal mechanism for inter-swarm communication. Agents within a given swarm have behavior that is inspired by the foraging activities of ants, with each agent capable of simple actions and knowledge of a global goal is not assumed. The creation of chemical trails is proposed as the primary mechanism used in distributed problem solving arising from self-organization of swarms of agents. The paper proposes that swarm chemistries can be engineered in order to apply the principal ideas of the Subsumption Architecture in the domain of mobile agents. The paper presents applications of the new architecture in the domain of communications networks and describes the essential elements of a mobile agent framework that is being considered for its implementation.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"39 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":"124266718","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}
引用次数: 143
Enhancing conventional search systems with multi-agent techniques: a case study 用多智能体技术增强传统搜索系统:一个案例研究
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699242
J. Denzinger, Dirk Fuchs
{"title":"Enhancing conventional search systems with multi-agent techniques: a case study","authors":"J. Denzinger, Dirk Fuchs","doi":"10.1109/ICMAS.1998.699242","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699242","url":null,"abstract":"Our TECHS concept (TEams for Cooperative Heterogeneous Search) is aimed at the cooperation of different search systems. Therefore, a search agent is a sequential search system with a fixed setting of its parameters. In a team of agents, several agents might use the same search system but then they must employ different parameters. In contrast to most other approaches the problem to solve is not partitioned into subproblems that are then given to the search agents. Instead, all agents obtain the whole problem. Exceptions are only made for agents that cannot \"understand\" the whole problem. They only get the parts they can work on. Thus, we can use existing sequential search systems in our teams. The data interchange between search agents in TECHS is both demand driven and success driven. Demand driven cooperation is characterized by agents computing patterns of data that would help them fulfil their search task and send these patterns as requests to other agents. The other agents then send all their data matching the patterns (that may be the result of additional computations triggered by the request) back to the requesting agent. Note that in search systems it is rather difficult to find criteria that can determine which data an agent needs to advance or finish a search task. The general idea of success driven data interchange is that an agent determines the data that was, so far, very useful for its search and periodically shares this data with its colleagues.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"43 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":"124315478","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}
引用次数: 8
Neural synthesis of teleo-reactive programs 遥控反应程序的神经合成
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699285
J. Ramírez
{"title":"Neural synthesis of teleo-reactive programs","authors":"J. Ramírez","doi":"10.1109/ICMAS.1998.699285","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699285","url":null,"abstract":"The Teleo-Reactive (TR) formalism has been presented as a new programming paradigm to write agent programs with reactive control and goal oriented behavior. The formalism is based in a circuit semantics that intuitively can be ported directly to a layered neural network architecture. But to capture the essence of the TR paradigm, a mechanism of synthesis must be developed, allowing to express in a neural architecture 1) the reactive nature of the programs. 2) the incremental learning of TR sequences and trees and 3) the continuous feedback from the world. We present an analysis of TR programs and a method to synthesize those programs into an ontogenic neural network model that captures all the features of the program and can evolve with the agent as he explores the world.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"21 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":"115374368","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}
引用次数: 2
Leveled commitment contracting among myopic individually rational agents 短视个体理性代理人之间的水平承诺契约
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699028
Martin Andersson, Tuomas Sandholm
{"title":"Leveled commitment contracting among myopic individually rational agents","authors":"Martin Andersson, Tuomas Sandholm","doi":"10.1109/ICMAS.1998.699028","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699028","url":null,"abstract":"In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agents to act efficiently upon future events. A leveled commitment protocol allows the agents to decommit from contracts by paying a monetary penalty to the contracting partner. The efficiency of such protocols depends heavily on how the penalties are decided. Different leveled commitment protocols and their parameterizations are empirically compared to each other and to several full commitment protocols. Many different aspects of contracting are studied, such as social welfare achieved, CPU-time usage, and amount of contracting and decommitting. If a global clock is used for increasing the decommitment penalties, infinite decommitment loops are prevented, while a local clock cannot guarantee this. Concerning solution quality, the leveled commitment protocols are significantly better than the full commitment protocols of the same type, but the differences between the different leveled commitment protocols are minor.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"34 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":"122642064","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}
引用次数: 49
Rational communicative behavior in anti-air defense 防空中的理性交往行为
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699052
Sanguk Noh, P. Gmytrasiewicz
{"title":"Rational communicative behavior in anti-air defense","authors":"Sanguk Noh, P. Gmytrasiewicz","doi":"10.1109/ICMAS.1998.699052","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699052","url":null,"abstract":"The authors' research addresses rational decision-making among anti-air units whose mission is to defend a specified territory from a number of attacking missiles. They present a decision-theoretic method that automated agents can use to select optimal communicative acts in this domain, given the characteristics of the threat situation. Since the communication bandwidth is usually limited in a battle field environment and disclosure of any information to hostile agents should be avoided, it is critical for a defending agent to be selective as to what messages should, or should not, be sent to other friendly agents. The work builds on their earlier work that uses the recursive modeling method (RMM) for coordination, and applies RMM to rational communication in the anti-air defense domain. They show how a defending automated agent can rank the values of alternative messages that could be communicated in a given defense situation. Further, they compare this ranking to communicative choices of human subjects under the same circumstances of the coordinated anti-air defense.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"34 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":"115757836","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}
引用次数: 10
How individuals negotiate societies 个人如何与社会谈判
Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI: 10.1109/ICMAS.1998.699027
E. Alonso
{"title":"How individuals negotiate societies","authors":"E. Alonso","doi":"10.1109/ICMAS.1998.699027","DOIUrl":"https://doi.org/10.1109/ICMAS.1998.699027","url":null,"abstract":"The author proposes a formal model of coordination in multi-agent systems. Wooldridge and Jennings (1996) restrict their approach to cooperative problem solving cases insisting in a team-formation stage in which agents commit themselves to act as a group to achieve a common goal before negotiation starts. In his model, autonomous agents first recognise how they depend on each other (they may need or prefer to interact about the same or different goals), and then, in the negotiation phase, exchange offers in the form of commissive speech acts. Finally, agents adopt social, interlocking, commitments if an agreement is reached. Joint plans are seen as deals and team activity as a special case of social activity. The main contributions of the work are: (a) social pre-conventions are not needed; (b) the outcome of the coordination process can achieve agents' goals only partially; (c) social notions are defined as the conjunction of their individual counterparts.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"8 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":"115596066","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}
引用次数: 21
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信