Motivated by applications in Dynamic Spectrum Access Networks, we focus on a system in which a few agents are engaged in a costly individual search where each agent's benefit is determined according to the minimum obtained value. Such a search pattern is applicable to many systems, including shipment and travel planning. This paper formally introduces and analyzes a sequential variant of the general model. According to that variant, only a single agent searches at any given time, and when an agent initiates its search, it has complete information about the minimum value obtained by the other agents so far. We prove that the search strategy of each agent, according to the equilibrium of the resulting Stackelberg game, is reservation-value based, and show how the reservation values can be calculated. We also analyze the agents' optimal search strategies when they are fully cooperative (i.e., when they aim to maximize the expected joint benefit). The equilibrium strategies and the expected benefit of each agent are illustrated using a synthetic homogeneous environment, thereby demonstrating the properties of this new search scheme and the benefits of cooperation.
{"title":"Sequential Multilateral Search for a Common Goal","authors":"Igor Rochlin, David Sarne, G. Zussman","doi":"10.1109/WI-IAT.2011.159","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.159","url":null,"abstract":"Motivated by applications in Dynamic Spectrum Access Networks, we focus on a system in which a few agents are engaged in a costly individual search where each agent's benefit is determined according to the minimum obtained value. Such a search pattern is applicable to many systems, including shipment and travel planning. This paper formally introduces and analyzes a sequential variant of the general model. According to that variant, only a single agent searches at any given time, and when an agent initiates its search, it has complete information about the minimum value obtained by the other agents so far. We prove that the search strategy of each agent, according to the equilibrium of the resulting Stackelberg game, is reservation-value based, and show how the reservation values can be calculated. We also analyze the agents' optimal search strategies when they are fully cooperative (i.e., when they aim to maximize the expected joint benefit). The equilibrium strategies and the expected benefit of each agent are illustrated using a synthetic homogeneous environment, thereby demonstrating the properties of this new search scheme and the benefits of cooperation.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128595897","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 proposes a constrained clustering method that is based on a graph-cut problem formalized by SDP (Semi-Definite Programming). Our SDP approach has the advantage of convenient constraint utilization compared with conventional spectral clustering methods. The algorithm starts from a single cluster of a complete dataset and repeatedly selects the largest cluster, which it then divides into two clusters by swapping rows and columns of a relational label matrix obtained by solving the maximum graph-cut problem. This swapping procedure is effective because we can create clusters without any computationally heavy matrix decomposition process to obtain a cluster label for each data. The results of experiments using a Web document dataset demonstrated that our method outperformed other conventional and the state of the art clustering methods in many cases. Hence we consider our clustering provides a promising basic method to interactive Web clustering.
{"title":"Graph-Cut Based Iterative Constrained Clustering","authors":"Masayuki Okabe, S. Yamada","doi":"10.1109/WI-IAT.2011.42","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.42","url":null,"abstract":"This paper proposes a constrained clustering method that is based on a graph-cut problem formalized by SDP (Semi-Definite Programming). Our SDP approach has the advantage of convenient constraint utilization compared with conventional spectral clustering methods. The algorithm starts from a single cluster of a complete dataset and repeatedly selects the largest cluster, which it then divides into two clusters by swapping rows and columns of a relational label matrix obtained by solving the maximum graph-cut problem. This swapping procedure is effective because we can create clusters without any computationally heavy matrix decomposition process to obtain a cluster label for each data. The results of experiments using a Web document dataset demonstrated that our method outperformed other conventional and the state of the art clustering methods in many cases. Hence we consider our clustering provides a promising basic method to interactive Web clustering.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080592","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 present a multiagent framework which enables the design and the test of real world embedded multiagent systems based on decentralized intelligence. The associated demonstration insists on the interactions between real world and virtual agents, the simulation of realistic physical environment.
{"title":"Real World Embedded Multiagent Systems: Simulation of Hardware/Software Mixed Agent Societes in Realistic Physical Models","authors":"Jean-Paul Jamont, M. Occello, E. Mendes","doi":"10.1109/WI-IAT.2011.227","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.227","url":null,"abstract":"This paper present a multiagent framework which enables the design and the test of real world embedded multiagent systems based on decentralized intelligence. The associated demonstration insists on the interactions between real world and virtual agents, the simulation of realistic physical environment.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134109027","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}
Protection of privacy is a major concern for users of social web applications, including social networks. Although most online social networks now offer fine-grained controls of information sharing, these are rarely used, both because their use imposes additional burden on the user and because they are too complex for an average user to handle. To mitigate the problem, we propose an intelligent privacy manager that automates the assignment of sharing permissions, taking into account the content of the published information and user's high-level sharing policies. At the core of our contribution is a novel privacy policy language which explicitly accounts for social web concepts and which balances the expressive power with representation complexity. The manager employs named entity recognition algorithms to annotate sensitive parts of published information and an answer set programming system to evaluate user's privacy policies and determine the list of safe recipients. We implemented a prototype of the manager on the Face book platform. On a small test scenario, the manager reached the F-measure value of 0.831 in correctly recommending safe recipients.
{"title":"Content-Based Privacy Management on the Social Web","authors":"M. Jakob, Zbynek Moler, M. Pechoucek, R. Vaculín","doi":"10.1109/WI-IAT.2011.208","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.208","url":null,"abstract":"Protection of privacy is a major concern for users of social web applications, including social networks. Although most online social networks now offer fine-grained controls of information sharing, these are rarely used, both because their use imposes additional burden on the user and because they are too complex for an average user to handle. To mitigate the problem, we propose an intelligent privacy manager that automates the assignment of sharing permissions, taking into account the content of the published information and user's high-level sharing policies. At the core of our contribution is a novel privacy policy language which explicitly accounts for social web concepts and which balances the expressive power with representation complexity. The manager employs named entity recognition algorithms to annotate sensitive parts of published information and an answer set programming system to evaluate user's privacy policies and determine the list of safe recipients. We implemented a prototype of the manager on the Face book platform. On a small test scenario, the manager reached the F-measure value of 0.831 in correctly recommending safe recipients.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133948705","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}
Over the past decades, advanced techniques for efficient diagnosis of malfunctioning systems have been developed. Agents equipped with such techniques that provide support in the diagnosis process have resulted from these diagnosis techniques. In general, diagnosis techniques focus on the reasoning part of the diagnostic process as well as improving the efficiency thereof. In some situations however, not the reasoning part, but the observation part of the diagnostic process is the main bottleneck and consequently requires attention. These situations arise when the costs of observing during the diagnostic process are not negligible in comparison to the costs of reasoning. This paper presents such an approach by extending an existing agent-based architecture for diagnosis. Several algorithms are proposed within the agent, tested and compared with respect to the total observation cost required to identify the root cause of a problem. The tests are performed in several situations with varying circumstances showing promising results.
{"title":"An Agent-Based Architecture for Model-Based Diagnosis Using Observation Cost","authors":"M. Hoogendoorn, Bas W. Knopper, A. V. Mee","doi":"10.1109/WI-IAT.2011.209","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.209","url":null,"abstract":"Over the past decades, advanced techniques for efficient diagnosis of malfunctioning systems have been developed. Agents equipped with such techniques that provide support in the diagnosis process have resulted from these diagnosis techniques. In general, diagnosis techniques focus on the reasoning part of the diagnostic process as well as improving the efficiency thereof. In some situations however, not the reasoning part, but the observation part of the diagnostic process is the main bottleneck and consequently requires attention. These situations arise when the costs of observing during the diagnostic process are not negligible in comparison to the costs of reasoning. This paper presents such an approach by extending an existing agent-based architecture for diagnosis. Several algorithms are proposed within the agent, tested and compared with respect to the total observation cost required to identify the root cause of a problem. The tests are performed in several situations with varying circumstances showing promising results.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133014425","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}
Jinping Yuan, L. Yao, Zhiyong Hao, Fang Liu, Tangming Yuan
This paper concerns a distributed argumentation system where different agents are equipped with argumentative knowledge base (henceforth referred as KB) within which conflict arguments are represented using attacking relations. This paper proposes the notion of "defensibility" of an argument in a distributed argumentation system and a multi-party dialogue game to compute the defensibility of an argument. In our approach, we have proposed the notion of critical factor, legal move function and critical countermeasure, for avoiding idle attack and invalid attack in the course of dialogues. It is anticipated that this research will contribute to argumentation research in MAS.
{"title":"Multi-party Dialogue Games for Distributed Argumentation System","authors":"Jinping Yuan, L. Yao, Zhiyong Hao, Fang Liu, Tangming Yuan","doi":"10.1109/WI-IAT.2011.14","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.14","url":null,"abstract":"This paper concerns a distributed argumentation system where different agents are equipped with argumentative knowledge base (henceforth referred as KB) within which conflict arguments are represented using attacking relations. This paper proposes the notion of \"defensibility\" of an argument in a distributed argumentation system and a multi-party dialogue game to compute the defensibility of an argument. In our approach, we have proposed the notion of critical factor, legal move function and critical countermeasure, for avoiding idle attack and invalid attack in the course of dialogues. It is anticipated that this research will contribute to argumentation research in MAS.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133015915","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}
Heiko Aydt, M. Lees, Linbo Luo, Wentong Cai, M. Low, Kabilen Sornum
Crowd behaviour is an interesting social phenomenon that emerges from complex interactions of individuals. An important aspect of individual behaviour is emotion which plays a significant role in all aspects of human decision making. For example, heightened emotional states can lead people to take highly unexpected or irrational actions. One popular motivation for simulation of virtual crowds is to generate believable characters in movies and computer games. Recently the concept of serious games has been introduced in both academic and industrial circles. In this paper, we propose an emotion engine, based on modern appraisal theory, that is able to model various emotional crowd characteristics. This appraisal engine is capable of capturing the dynamics of emotional contagion and we show how different crowd composition can lead to different patterns of emotional contagion. In addition, we describe a serious game designed for training military personnel in peaceful crowd control. We evaluate this engine in the context of a property protection protest scenario where the players or soldiers are tasked to maintain a peaceful protest without violence. A systematic evaluation is presented which supports the facial validity of the emotion engine and our model of emotional contagion.
{"title":"A Computational Model of Emotions for Agent-Based Crowds in Serious Games","authors":"Heiko Aydt, M. Lees, Linbo Luo, Wentong Cai, M. Low, Kabilen Sornum","doi":"10.1109/WI-IAT.2011.154","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.154","url":null,"abstract":"Crowd behaviour is an interesting social phenomenon that emerges from complex interactions of individuals. An important aspect of individual behaviour is emotion which plays a significant role in all aspects of human decision making. For example, heightened emotional states can lead people to take highly unexpected or irrational actions. One popular motivation for simulation of virtual crowds is to generate believable characters in movies and computer games. Recently the concept of serious games has been introduced in both academic and industrial circles. In this paper, we propose an emotion engine, based on modern appraisal theory, that is able to model various emotional crowd characteristics. This appraisal engine is capable of capturing the dynamics of emotional contagion and we show how different crowd composition can lead to different patterns of emotional contagion. In addition, we describe a serious game designed for training military personnel in peaceful crowd control. We evaluate this engine in the context of a property protection protest scenario where the players or soldiers are tasked to maintain a peaceful protest without violence. A systematic evaluation is presented which supports the facial validity of the emotion engine and our model of emotional contagion.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133019315","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}
J. Kwak, Rong Yang, Zhengyu Yin, Matthew E. Taylor, Milind Tambe
Despite their worst-case NEXP-complete planning complexity, DEC-POMDPs remain a popular framework for multiagent teamwork. This paper introduces effective teamwork under model uncertainty (i.e., potentially inaccurate transition and observation functions) as a novel challenge for DEC-POMDPs and presents MODERN, the first execution-centric framework for DEC-POMDPs explicitly motivated by addressing such model uncertainty. MODERN's shift of coordination reasoning from planning-time to execution-time avoids the high cost of computing optimal plans whose promised quality may not be realized in practice. There are three key ideas in MODERN: (i) it maintains an exponentially smaller model of other agents' beliefs and actions than in previous work and then further reduces the computation-time and space expense of this model via bounded pruning, (ii) it reduces execution-time computation by exploiting BDI theories of teamwork, and limits communication to key trigger points, and (iii) it limits its decision-theoretic reasoning about communication to trigger points and uses a systematic markup to encourage extra communication at these points -- thus reducing uncertainty among team members at trigger points. We empirically show that MODERN is substantially faster than existing DEC-POMDP execution-centric methods while achieving significantly higher reward.
{"title":"Towards Addressing Model Uncertainty: Robust Execution-Time Coordination for Teamwork","authors":"J. Kwak, Rong Yang, Zhengyu Yin, Matthew E. Taylor, Milind Tambe","doi":"10.1109/WI-IAT.2011.82","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.82","url":null,"abstract":"Despite their worst-case NEXP-complete planning complexity, DEC-POMDPs remain a popular framework for multiagent teamwork. This paper introduces effective teamwork under model uncertainty (i.e., potentially inaccurate transition and observation functions) as a novel challenge for DEC-POMDPs and presents MODERN, the first execution-centric framework for DEC-POMDPs explicitly motivated by addressing such model uncertainty. MODERN's shift of coordination reasoning from planning-time to execution-time avoids the high cost of computing optimal plans whose promised quality may not be realized in practice. There are three key ideas in MODERN: (i) it maintains an exponentially smaller model of other agents' beliefs and actions than in previous work and then further reduces the computation-time and space expense of this model via bounded pruning, (ii) it reduces execution-time computation by exploiting BDI theories of teamwork, and limits communication to key trigger points, and (iii) it limits its decision-theoretic reasoning about communication to trigger points and uses a systematic markup to encourage extra communication at these points -- thus reducing uncertainty among team members at trigger points. We empirically show that MODERN is substantially faster than existing DEC-POMDP execution-centric methods while achieving significantly higher reward.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116402616","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}
We present an empirical study of distributed adaptation in an Intrusion Detection System. The adaptation model is based on a game-theoretical approach and we use regret minimization techniques to find globally robust behavior. We compare the effectiveness of global optimization, when all system components adopt the globally optimized strategy in a synchronized manner, with a fully distributed approach when two layers in the system adapt their strategies as a result of local adaptation process, with no synchronization or signaling. We show that the use of regret minimization techniques results in stable and long-term optimized behavior in both cases. Our experiments were performed on CAMNEP, an intrusion detection system based on analysis of Net Flow data, and were performed on the university network over one month.
{"title":"On the Value of Coordination in Distributed Self-Adaptation of Intrusion Detection System","authors":"M. Rehák, Martin Grill, Jan Stiborek","doi":"10.1109/WI-IAT.2011.172","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.172","url":null,"abstract":"We present an empirical study of distributed adaptation in an Intrusion Detection System. The adaptation model is based on a game-theoretical approach and we use regret minimization techniques to find globally robust behavior. We compare the effectiveness of global optimization, when all system components adopt the globally optimized strategy in a synchronized manner, with a fully distributed approach when two layers in the system adapt their strategies as a result of local adaptation process, with no synchronization or signaling. We show that the use of regret minimization techniques results in stable and long-term optimized behavior in both cases. Our experiments were performed on CAMNEP, an intrusion detection system based on analysis of Net Flow data, and were performed on the university network over one month.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116592548","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}
Salah-Eddine Tbahriti, B. Medjahed, Zaki Malik, C. Ghedira, M. Mrissa
In this paper, we present Meerkat, a dynamic framework for preserving privacy in Web services. We define a Web service-aware privacy model that deals with the privacy of input data, output data, and operation usage. We introduce a matching protocol that caters for partial and total privacy compatibility. Finally, we propose a negotiation model to reconcile clients' requirements with providers' policies in case of incompatibility.
{"title":"Meerkat - A Dynamic Privacy Framework for Web Services","authors":"Salah-Eddine Tbahriti, B. Medjahed, Zaki Malik, C. Ghedira, M. Mrissa","doi":"10.1109/WI-IAT.2011.38","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.38","url":null,"abstract":"In this paper, we present Meerkat, a dynamic framework for preserving privacy in Web services. We define a Web service-aware privacy model that deals with the privacy of input data, output data, and operation usage. We introduce a matching protocol that caters for partial and total privacy compatibility. Finally, we propose a negotiation model to reconcile clients' requirements with providers' policies in case of incompatibility.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121734730","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
扫码关注我们
求助内容：
应助结果提醒方式：