Hock Chuan Lim, Rob Stocker, M. Barlow, Henry Larkin
{"title":"Interplay of ethical trust and social moral norms: Environment modelling and computational mechanisms in agent-based social simulation (ABSS)","authors":"Hock Chuan Lim, Rob Stocker, M. Barlow, Henry Larkin","doi":"10.3233/WIA-2011-0225","DOIUrl":"https://doi.org/10.3233/WIA-2011-0225","url":null,"abstract":"In many agent-based models theoretical and computational mechanisms are needed for model abstraction and design. However, it can be challenging to arrive at the appropriate mechanisms and models. This research on the interplay of ethical trust and social moral norms addresses that challenge via an analytical framework on the spread of moral norms, the modelling of social environment and the selection of spread mechanisms as applied to agent-based social simulation. We describe the mechanism alignment mapping, two forms of interaction modelling between the social environment and agents, and the results obtained from the simulation of our computational model. These results provide an insight into how the agent-based paradigm can be applied as a technique of investigation for normative moral processes in computational social sciences.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116370220","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":"Full discrimination of subtopics in search results with keyphrase-based clustering","authors":"Claudio Carpineto, M. D'Amico, Andrea Bernardini","doi":"10.3233/WIA-2011-0222","DOIUrl":"https://doi.org/10.3233/WIA-2011-0222","url":null,"abstract":"We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we present a novel search results clustering algorithm that generates clusters labeled by keyphrases. The keyphrases are extracted from the generalized suffix tree built from the search results and merged through an improved hierarchical agglomerative clustering procedure. Our approach has been implemented into KeySRC (Keyphrase-based Search Results Clustering), a full web clustering engine available online at http://keysrc.fub.it. We discuss how the keyphrase-based clustering algorithm can be used not only for browsing through the clustered search results but also for producing a re-ranked list of results emphasizing the diversity of top hits. Using a novel measure for evaluating full-subtopic retrieval performance, called “Subtopic Search Length under k document sufficiency”, and a test collection specifically designed for evaluating subtopic retrieval, we found that our approach was able to discriminate between the different subtopics present in search results in a very effective manner, with a clear improvement over other subtopic retrieval systems. In particular, browsing through KeySRC clusters was the best method to retrieve more documents per subtopic (i.e., k>1), whereas using the re-ranked list formed from KeySRC clusters was more effecive for retrieving just one document per subtopic (i.e., k=1).","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122381968","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}
Salvatore Garruzzo, G. Quattrone, D. Rosaci, D. Ursino
{"title":"Improving agent interoperability via the automatic enrichment of multi-category ontologies","authors":"Salvatore Garruzzo, G. Quattrone, D. Rosaci, D. Ursino","doi":"10.3233/WIA-2011-0220","DOIUrl":"https://doi.org/10.3233/WIA-2011-0220","url":null,"abstract":"Ontologies significantly enhance the possibility to make agent-based Web applications really “semantic”. However, in order to make their usage both effective and efficient, some alignment problems, arising from the presence of semantic heterogeneities among them, should be solved. Recent approaches introduced the possibility to face these problems by allowing agents to negotiate the meanings of the terms contained in their ontology and exchanged among them. This solution appears significantly effective but not particularly efficient since its computational cost increases linearly against the number of agents belonging to the community. This paper proposes a new framework aiming at solving efficiently ontology alignment problems; for this purpose, it exploits: (i) a light bilateral negotiation procedure which allows an agent to understand a message coming from another agent correctly, (ii) a global ontology, which avoids heavy semantic negotiation activities, (iii) an ontology enrichment algorithm, which allows ontology alignment to be performed with an effectiveness comparable with that obtained by semantic negotiation approaches, and (iv) a new ontology model supporting efficient and effective communication activities among agents.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125134959","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":"Let's dans! An analytic framework of negotiation dynamics and strategies","authors":"K. Hindriks, C. Jonker, D. Tykhonov","doi":"10.3233/WIA-2011-0221","DOIUrl":"https://doi.org/10.3233/WIA-2011-0221","url":null,"abstract":"The “negotiation dance”, as Raiffa calls the dynamic pattern of the bidding, has an important influence on the outcome of the negotiation. The current practice of evaluating a negotiation strategy is to focus on fairness and quality aspects of the agreement. In this article we present the framework DANS (Dynamics Analysis of Negotiation Strategies) for the analysis of the dynamic patterns of the bidding as a means to evaluate the strengths and weaknesses of negotiation strategies for bidding. The method provides the tools to perform a detailed and quantified analysis of a negotiation between two agents in terms of dynamic properties of the negotiation trace. The classification of negotiation steps in the dance plays a central role in the analysis. The method can be applied to tournaments, but can also be used to analyze single 1-on-1 negotiation sessions. The sessions can be played by humans or by software agents. Using DANS we show that some strategies are sensitive to the bidding behaviour of the opponent, and some depend on a correct model of the opponent. DANS helped us in discovering that domain characteristics are important for the analysis of strategies. Some strategies rely heavily on some domain assumptions. Furthermore, the results illustrate that having domain knowledge is not always enough to avoid making unintentional steps. The method is demonstrated in the analysis of three strategies from the literature ABMP, Trade-Off and Bayesian Agent.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121060541","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 control in a normative framework: An adaptive deterrence approach","authors":"Henrique Lopes Cardoso, E. Oliveira","doi":"10.3233/WIA-2011-0224","DOIUrl":"https://doi.org/10.3233/WIA-2011-0224","url":null,"abstract":"Normative environments are used to regulate multi-agent interactions, by providing means for monitoring and enforcing agents' compliance with their commitments. In business encounters, agents representing business entities make contracts including norms that prescribe what agents should do. Agent autonomy, however, gives agents the ability to decide whether to fulfill or violate their commitments. In particular, when the normative space is imperfect, contracts to which norms apply may be unbalanced, making it individually rational for agents to exploit potential flaws to their own advantage. In this paper we present and analyze an approach for exerting social control within a normative environment. An adaptive mechanism is proposed that enables a normative framework to change deterrence sanctions according to the behavior of an agent population, in order to preclude agents from exploiting potential normative flaws. The system tries to avoid institutional control beyond what is strictly necessary, seeking to maximize agent contracting activity while ensuring a certain commitment compliance level, when agents have unknown risk and social attitudes. We analyze how the adaptive deterrence sanctioning model responds to different agent populations, which are characterized by predominant risk tolerance or social awareness degrees. We show that risk-averse or socially concerned populations cause lesser deterrence sanctions to be imposed by the normative system.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134639909","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 adaptive approach for the determination of the itinerary of imprecise mobile agents with timing constraints","authors":"Luciana Rech, C. Montez, R. S. Oliveira","doi":"10.3233/WIA-2011-0218","DOIUrl":"https://doi.org/10.3233/WIA-2011-0218","url":null,"abstract":"Algorithms to determine the itinerary of agents are fundamental in the context of distributed applications based on mobile agents with timing requirements. To establish an agent's itinerary it is necessary to consider the trade-offs between achieving high-quality results while meeting firm deadlines. In this paper we describe and evaluate two adaptive heuristics that make a decision about the behavior for an agent at the beginning of its mission. The decision-making about the behavior is based on a log of benefits collected by the mobile agent in past executions. An agent adapts itself at the departure. Once chosen the behavior for a particular mission, the agent keeps this behavior until the end of the mission.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123661733","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":"Concept abduction and contraction in semantic-based P2P environments","authors":"M. Ruta, E. Sciascio, F. Scioscia","doi":"10.3233/WIA-2011-0214","DOIUrl":"https://doi.org/10.3233/WIA-2011-0214","url":null,"abstract":"Reasoning engines are largely used in resource discovery and matchmaking scenarios where, given a request, they are able to provide a list of compatible items arranged in relevance order. A significant added value is the possibility to explain match outcomes in order to obtain information for modifying or refining early queries. Though the feasibility of running logic-based reasoning tasks over various knowledge bases has been widely proven on fixed servers, it is a challenging subject to execute inference processes on handheld devices. The paper presents a revised lightweight version of abduction and contraction algorithms (going back to previous works) for matchmaking in Description Logics in mobile ad-hoc contexts. Implementation and tests have been carried out in a mobile P2P case study based on a simplified Bluetooth interaction paradigm.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125515674","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":"Representing privacy regulations with deontico-temporal operators","authors":"G. Piolle, Y. Demazeau","doi":"10.3233/WIA-2011-0215","DOIUrl":"https://doi.org/10.3233/WIA-2011-0215","url":null,"abstract":"The aim of this study is to provide artificial agents with logical tools to reason specifically on privacy-related regulations, in order to comply with them. In order to express these regulations, the Deontic Logic for Privacy (DLP) is proposed. DLP is a deontic and temporal logic based on predicates dealing with personal data management. Illustrated by an example, it becomes obvious that specific operators are needed to express mixed deontic and temporal notions such as obligations with deadlines and maintained interdictions. A set of eight specific requirements is defined for such operators. The existing proposals in the field are then evaluated with respect to these criteria, and found insufficient. Two new operators are tailored to fit both the DLP formalism and the eight requirements. It is then shown how such operators can be used to translate typical privacy regulations in logical formulae via the DLP language.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115487147","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":"Trust-based web service selection in virtual communities","authors":"Zhiqi Shen, Han Yu, C. Miao, J. Weng","doi":"10.3233/WIA-2011-0216","DOIUrl":"https://doi.org/10.3233/WIA-2011-0216","url":null,"abstract":"In the present web service architecture, selecting which web service to use is still a task which requires a high level of human intervention. In this paper, we propose a trust-based web service selection process which aspires to automate part of the web service selection task to decrease the workload of human designers in the process. Most of the existing web service selection mechanisms are capability oriented or function oriented. We propose a trust-based web service selection approach to augment the current web service mechanisms. A trust model from our previous research, which offers strong protection against the adverse effect of unfair ratings from witnesses, is incorporated into an agent augmented service oriented virtual community. An experiment based on the virtual community system is conducted to study the effectiveness of the model in enabling trust agents to select highly trustworthy web services with minimal human supervision.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124734754","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 study of the impact of structure on cooperation in networks","authors":"Stephan Schosser, Klemens Böhm, B. Vogt","doi":"10.3233/WIA-2011-0219","DOIUrl":"https://doi.org/10.3233/WIA-2011-0219","url":null,"abstract":"The concern of this paper is that nodes in a distributed system cooperate. We demonstrate that adding structure to such systems can help to induce cooperation. ‘Adding structure’ means bounding the number of nodes a node can directly interact with - if two unconnected nodes wish to interact, they have to do so via a chain of intermediaries which are connected. To validate our claim, we analyze one specific system where structure has been added. Different methods exist for such analyses: Economists use behavioral experiments to study human behavior. Computer scientists rely on simulations, to obtain results that are robust and scalable. Both use game theory to arrive at formal results. Each approach in isolation has its disadvantages: Behavioral experiments do not allow analyzing many different combinations of parameter values and do not scale well. Game theory supports analyzing system equilibria, but may result in complex or even unsolvable models, in particular when considering system dynamics. Simulations rely on the intuition of the system designer - this is hazardous in strategic settings. We pursue a combination of these approaches and show that the degree of cooperation in our setting is high. More specifically, after having shown with behavioral experiments that humans tend to use cut-off strategies, we translate the strategies used into a game theoretic model and show that they yield an efficient equilibrium. Simulations show that the system reaches this equilibrium given random start populations if the rate of free riders is low. We conclude by saying how our work affects the design of distributed systems from a computer science perspective.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125654800","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}