Multi agent system MAS model has been extensively used in the different tasks of E-Commerce such as customer relation management CRM, negotiation and brokering. The objective of this paper is to evaluate a seller agent's various cognitive parameters like capability, trust, and desire. After selecting a best seller agent from ordering queue, it applies negotiation strategies to find the most profitable proposal for both buyer and seller. This mechanism belongs to a semi cooperative negotiation type, and selecting a seller and buyer agent pair using mental and cognitive parameters. This work provides a logical cognitive model, logical negotiation model between buyer agent and selected seller agent.
{"title":"Multi-Agent Negotiation Paradigm for Agent Selection in B2C E-Commerce","authors":"B. Mazumdar, Swati Basak, Neelam Modanwal","doi":"10.4018/jats.2011040103","DOIUrl":"https://doi.org/10.4018/jats.2011040103","url":null,"abstract":"Multi agent system MAS model has been extensively used in the different tasks of E-Commerce such as customer relation management CRM, negotiation and brokering. The objective of this paper is to evaluate a seller agent's various cognitive parameters like capability, trust, and desire. After selecting a best seller agent from ordering queue, it applies negotiation strategies to find the most profitable proposal for both buyer and seller. This mechanism belongs to a semi cooperative negotiation type, and selecting a seller and buyer agent pair using mental and cognitive parameters. This work provides a logical cognitive model, logical negotiation model between buyer agent and selected seller agent.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"38 1","pages":"33-52"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77665272","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}
Entities interacting on the web establish their identity by creating virtual personas. These entities, or agents, can be human users or software-based. This research models identity using the Entity-Persona Model, a semantically annotated social network inferred from the persistent traces of interaction between personas on the web. A Persona Mapping Algorithm is proposed which compares the local views of personas in their social network referred to as their Virtual Signatures, for structural and semantic similarity. The semantics of the Entity-Persona Model are modeled by a vector space model of the text associated with the personas in the network, which allows comparison of their Virtual Signatures. This enables all the publicly accessible personas of an entity to be identified on the scale of the web. This research enables an agent to identify a single entity using multiple personas on different networks, provided that multiple personas exhibit characteristic behavior. The agent is able to increase the trustworthiness of on-line interactions by establishing the identity of entities operating under multiple personas. Consequently, reputation measures based on on-line interactions with multiple personas can be aggregated and resolved to the true singular identity.
{"title":"Modeling Virtual Footprints","authors":"Rajiv Kadaba","doi":"10.4018/jats.2011040101","DOIUrl":"https://doi.org/10.4018/jats.2011040101","url":null,"abstract":"Entities interacting on the web establish their identity by creating virtual personas. These entities, or agents, can be human users or software-based. This research models identity using the Entity-Persona Model, a semantically annotated social network inferred from the persistent traces of interaction between personas on the web. A Persona Mapping Algorithm is proposed which compares the local views of personas in their social network referred to as their Virtual Signatures, for structural and semantic similarity. The semantics of the Entity-Persona Model are modeled by a vector space model of the text associated with the personas in the network, which allows comparison of their Virtual Signatures. This enables all the publicly accessible personas of an entity to be identified on the scale of the web. This research enables an agent to identify a single entity using multiple personas on different networks, provided that multiple personas exhibit characteristic behavior. The agent is able to increase the trustworthiness of on-line interactions by establishing the identity of entities operating under multiple personas. Consequently, reputation measures based on on-line interactions with multiple personas can be aggregated and resolved to the true singular identity.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"3 1","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81174028","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}
Diffusion is a process by which information, viruses, ideas, or new behavior spread over social networks. Traditional diffusion models are history insensitive, i.e. only giving activated nodes a one-time chance to activate each of its neighboring nodes with some probability. But history dependent interactions between people are often observed in the real world. This paper proposes the History Sensitive Cascade Model HSCM, a model of information cascade through a network over time. The authors consider the "activation" problem of finding the probability of that a particular node receives information given that some nodes are initially informed. In this paper it is also proven that selecting a set of k nodes with greatest expected influence is NP-hard, and results from submodular functions are used to provide a greedy approximation algorithm with a 1-1/e-e lower bound, where e depends polynomially on the precision of the solution to the "activation" problem. Finally, experiments are performed comparing the greedy algorithm to three other approximation algorithms.
{"title":"History Sensitive Cascade Model","authors":"Yu Zhang, Maksim Tsikhanovich, Georgi Smilyanov","doi":"10.4018/jats.2011040104","DOIUrl":"https://doi.org/10.4018/jats.2011040104","url":null,"abstract":"Diffusion is a process by which information, viruses, ideas, or new behavior spread over social networks. Traditional diffusion models are history insensitive, i.e. only giving activated nodes a one-time chance to activate each of its neighboring nodes with some probability. But history dependent interactions between people are often observed in the real world. This paper proposes the History Sensitive Cascade Model HSCM, a model of information cascade through a network over time. The authors consider the \"activation\" problem of finding the probability of that a particular node receives information given that some nodes are initially informed. In this paper it is also proven that selecting a set of k nodes with greatest expected influence is NP-hard, and results from submodular functions are used to provide a greedy approximation algorithm with a 1-1/e-e lower bound, where e depends polynomially on the precision of the solution to the \"activation\" problem. Finally, experiments are performed comparing the greedy algorithm to three other approximation algorithms.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"25 1","pages":"53-66"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80840702","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}
In this paper, the authors propose software architecture to monitor elderly or dependent people in their own house. Many studies have been done on hardware aspects resulting in operational products, but there is a lack of adaptive algorithms to handle all the data generated by these products due to data being distributed and heterogeneous in a large scale environment. The authors propose a multi-agent classification method to collect and to aggregate data about activity, movements, and physiological information of the monitored people. Data generated at this local level are communicated and adjusted between agents to obtain a set of patterns. This data is dynamic; the system has to store the built patterns and has to create new patterns when new data is available. Therefore, the system is adaptive and can be spread on a large scale. Generated data is used at a local level, for example to raise an alert, but also to evaluate global risks. This paper presents specification choices and the massively multi-agent architecture that was developed; an example with a sample of ten dependant people gives an illustration.
{"title":"Meta-Monitoring Using an Adaptive Agent-Based System to Support Dependent People in Place","authors":"N. Singer, Sylvie Trouilhet, Ali Rammal","doi":"10.4018/jats.2011010104","DOIUrl":"https://doi.org/10.4018/jats.2011010104","url":null,"abstract":"In this paper, the authors propose software architecture to monitor elderly or dependent people in their own house. Many studies have been done on hardware aspects resulting in operational products, but there is a lack of adaptive algorithms to handle all the data generated by these products due to data being distributed and heterogeneous in a large scale environment. The authors propose a multi-agent classification method to collect and to aggregate data about activity, movements, and physiological information of the monitored people. Data generated at this local level are communicated and adjusted between agents to obtain a set of patterns. This data is dynamic; the system has to store the built patterns and has to create new patterns when new data is available. Therefore, the system is adaptive and can be spread on a large scale. Generated data is used at a local level, for example to raise an alert, but also to evaluate global risks. This paper presents specification choices and the massively multi-agent architecture that was developed; an example with a sample of ten dependant people gives an illustration.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"1 1","pages":"39-51"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86449790","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}
This paper studies the concept of tolerance in dynamic social networks where agents are able to make and break connections with neighbors to improve their payoffs. This problem was initially introduced to the authors by observing resistance or tolerance in experiments run in dynamic networks under the two rules that they have developed: the Highest Rewarding Neighborhood rule and the Highest Weighted Reward rule. These rules help agents evaluate their neighbors and decide whether to break a connection or not. They introduce the idea of tolerance in dynamic networks by allowing an agent to maintain a relationship with a bad neighbor for some time. In this research, the authors investigate and define the phenomenon of tolerance in dynamic social networks, particularly with the two rules. The paper defines a mathematical model to predict an agent's tolerance of a bad neighbor and determine the factors that affect it. After defining a general version of tolerance, the idea of optimal tolerance is explored, providing situations in which tolerance can be used as a tool to affect network efficiency and network structure.
{"title":"Simulating Tolerance in Dynamic Social Networks","authors":"Kristen Lund, Yu Zhang","doi":"10.4018/jats.2011010105","DOIUrl":"https://doi.org/10.4018/jats.2011010105","url":null,"abstract":"This paper studies the concept of tolerance in dynamic social networks where agents are able to make and break connections with neighbors to improve their payoffs. This problem was initially introduced to the authors by observing resistance or tolerance in experiments run in dynamic networks under the two rules that they have developed: the Highest Rewarding Neighborhood rule and the Highest Weighted Reward rule. These rules help agents evaluate their neighbors and decide whether to break a connection or not. They introduce the idea of tolerance in dynamic networks by allowing an agent to maintain a relationship with a bad neighbor for some time. In this research, the authors investigate and define the phenomenon of tolerance in dynamic social networks, particularly with the two rules. The paper defines a mathematical model to predict an agent's tolerance of a bad neighbor and determine the factors that affect it. After defining a general version of tolerance, the idea of optimal tolerance is explored, providing situations in which tolerance can be used as a tool to affect network efficiency and network structure.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"158 1","pages":"52-68"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87263512","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}
In this paper, the authors present a computational model of a fundamental social phenomenon in the study of animal behavior: the foraging. The purpose of this work is, first, to test the validity of the proposed model compared to another existing model, the flocking model; then, to try to understand whether the model may provide useful suggestions in studying the size of the group in some species of social mammals.
{"title":"Quasi-PSO Algorithm for Modeling Foraging Dynamics in Social Mammals","authors":"Marco Campennì, F. Cecconi","doi":"10.4018/jats.2011010103","DOIUrl":"https://doi.org/10.4018/jats.2011010103","url":null,"abstract":"In this paper, the authors present a computational model of a fundamental social phenomenon in the study of animal behavior: the foraging. The purpose of this work is, first, to test the validity of the proposed model compared to another existing model, the flocking model; then, to try to understand whether the model may provide useful suggestions in studying the size of the group in some species of social mammals.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"44 1","pages":"27-38"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82536082","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}
Trust is a very important quality attribute of an e-service. In particular, the increasing complexity of the e-business environment requires the development of new computational models of trust and reputation for e-business agents. In this paper, the authors introduce a new reputation model for agents engaged in e-business transactions. The model enhances classic reputation models by the addition of forgiveness factor and the use of new sources of reputation information based on agents groups. The paper proposes an improvement of this model by employing the recent con-resistance concept. Finally, the authors show how the model can be used in an agent-based market environment where trusted buyer and seller agents meet, negotiate, and transact multi-issue e-business contracts. The system was implemented using JADE multi-agent platform and initially evaluated on a sample set of scenarios. The paper introduces the design and implementation of the agent-based system together with the experimental scenarios and results.
{"title":"Enhanced Reputation Model with Forgiveness for E-Business Agents","authors":"Radu Burete, A. Bădică, C. Bǎdicǎ, F. Moraru","doi":"10.4018/jats.2011010102","DOIUrl":"https://doi.org/10.4018/jats.2011010102","url":null,"abstract":"Trust is a very important quality attribute of an e-service. In particular, the increasing complexity of the e-business environment requires the development of new computational models of trust and reputation for e-business agents. In this paper, the authors introduce a new reputation model for agents engaged in e-business transactions. The model enhances classic reputation models by the addition of forgiveness factor and the use of new sources of reputation information based on agents groups. The paper proposes an improvement of this model by employing the recent con-resistance concept. Finally, the authors show how the model can be used in an agent-based market environment where trusted buyer and seller agents meet, negotiate, and transact multi-issue e-business contracts. The system was implemented using JADE multi-agent platform and initially evaluated on a sample set of scenarios. The paper introduces the design and implementation of the agent-based system together with the experimental scenarios and results.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"18 1","pages":"11-26"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78164671","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}
The objective of Resource Allocation and Monitoring System is to make the procedures involved in allocating fund resources to competing clients transparent so that deserving candidates get funds. Proactive and goal directed behaviour of agents make the system transparent and intelligent. This paper presents design of Multi Agent Systems for Resource Allocation and Monitoring using Agent Unified Modelling Language AUML and implementation in agent based development tool. At a conceptual level, three agents are identified with their roles and responsibilities. The identified agents, functionalities, and interactions are also included and results show that multi agent technology can be used for effective decision making for resource allocation and monitoring problem.
{"title":"Design of Multi Agent System for Resource Allocation and Monitoring","authors":"M. S. Devi, Manish Arora","doi":"10.4018/jats.2011010101","DOIUrl":"https://doi.org/10.4018/jats.2011010101","url":null,"abstract":"The objective of Resource Allocation and Monitoring System is to make the procedures involved in allocating fund resources to competing clients transparent so that deserving candidates get funds. Proactive and goal directed behaviour of agents make the system transparent and intelligent. This paper presents design of Multi Agent Systems for Resource Allocation and Monitoring using Agent Unified Modelling Language AUML and implementation in agent based development tool. At a conceptual level, three agents are identified with their roles and responsibilities. The identified agents, functionalities, and interactions are also included and results show that multi agent technology can be used for effective decision making for resource allocation and monitoring problem.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"55 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72810426","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}
First, a couple of anecdotes: While I was working on a class lecture a few days ago in my office, a “flash mob” showed up on the quadrangle in front of my window and danced to their iPods for a while before dispersing. Flash mobs were (briefly) a concern for police and other authorities in places like Minsk (Shirky, 2008, p. 165), Philadelphia (Urbina, 2010) and elsewhere, where the alarmingly sudden presence of people loosely coupled through their text messaging or blogging triggered fears of anarchy. But, watching them dance, I remembered another, similar term: flash crowds—the sudden surge of internet traffic associated with, for example, a denial-of-service attack. The similarity is not just incidental—they appear to both derive, New Robot Revolution, Multi-Agency and the Machinic: Review of Gerald Raunig’s A Thousand Machines
先说几件轶事:几天前，当我在办公室准备一堂课时，一群“快闪族”出现在我窗前的四合院上，他们跟着ipod跳了一会儿舞，然后散开了。在明斯克(Shirky, 2008, p. 165)、费城(Urbina, 2010)和其他地方，快闪族(Flash暴徒)是警察和其他当局(短暂地)关注的问题，在这些地方，人们通过短信或博客松散地联系在一起，令人震惊地突然出现，引发了对无政府状态的恐惧。但是，看着他们跳舞，我想起了另一个类似的术语:闪电人群——互联网流量的突然激增，例如，与拒绝服务攻击有关。这种相似之处并非偶然——它们似乎都衍生出《新机器人革命》、《多机构》和《机械》:杰拉德·劳尼格《一千台机器》书评
{"title":"New Robot Revolution, Multi-Agency and the Machinic: Review of Gerald Raunig's A Thousand Machines","authors":"S. Collins","doi":"10.4018/jats.2011010106","DOIUrl":"https://doi.org/10.4018/jats.2011010106","url":null,"abstract":"First, a couple of anecdotes: While I was working on a class lecture a few days ago in my office, a “flash mob” showed up on the quadrangle in front of my window and danced to their iPods for a while before dispersing. Flash mobs were (briefly) a concern for police and other authorities in places like Minsk (Shirky, 2008, p. 165), Philadelphia (Urbina, 2010) and elsewhere, where the alarmingly sudden presence of people loosely coupled through their text messaging or blogging triggered fears of anarchy. But, watching them dance, I remembered another, similar term: flash crowds—the sudden surge of internet traffic associated with, for example, a denial-of-service attack. The similarity is not just incidental—they appear to both derive, New Robot Revolution, Multi-Agency and the Machinic: Review of Gerald Raunig’s A Thousand Machines","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"39 1","pages":"69-75"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86544959","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}
An autonomous mobile agent is an executing program that can migrate from machine to machine in a heterogeneous network under its own control. An agent can either follow a pre-assigned path on the network or determine its itinerary based on the data collected from the network. Facilities for highly dynamic movement of code and data enable a program to take advantage of the locality of data. It also allows one to optimize between the requirements of low bandwidth, high latency and disconnected network connections. This computing paradigm, which exploits code, data and state mobility, raises many new security issues that are quite different from conventional client/server systems. Agent servers that provide an execution environment for the agents to execute can be attacked by malicious agents. Similarly agents could be carrying sensitive information about their owners and should be protected from tampering by malicious hosts. The data collected by the agent from one host should also be protected from tampering by another host in the itinerary. In this paper, various security issues that arise in mobile agents applications were examined.
{"title":"Security Issues in Mobile Agent Applications","authors":"O. Ojesanmi","doi":"10.4018/jats.2010100104","DOIUrl":"https://doi.org/10.4018/jats.2010100104","url":null,"abstract":"An autonomous mobile agent is an executing program that can migrate from machine to machine in a heterogeneous network under its own control. An agent can either follow a pre-assigned path on the network or determine its itinerary based on the data collected from the network. Facilities for highly dynamic movement of code and data enable a program to take advantage of the locality of data. It also allows one to optimize between the requirements of low bandwidth, high latency and disconnected network connections. This computing paradigm, which exploits code, data and state mobility, raises many new security issues that are quite different from conventional client/server systems. Agent servers that provide an execution environment for the agents to execute can be attacked by malicious agents. Similarly agents could be carrying sensitive information about their owners and should be protected from tampering by malicious hosts. The data collected by the agent from one host should also be protected from tampering by another host in the itinerary. In this paper, various security issues that arise in mobile agents applications were examined.","PeriodicalId":93648,"journal":{"name":"International journal of agent technologies and systems","volume":"45 1","pages":"39-55"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76005319","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
扫码关注我们
求助内容：
应助结果提醒方式：