Results 1 - 10
of
102
Developing an Integrated Trust and Reputation Model for Open Multi-Agent Systems
, 2004
"... Trust and reputation are central to effective interactions in open multi-agent systems in which agents, that are owned by a variety of stakeholders, can enter and leave the system at any time. This openness means existing trust and reputation models cannot readily be used. To this end, we present FI ..."
Abstract
-
Cited by 210 (12 self)
- Add to MetaCart
(Show Context)
Trust and reputation are central to effective interactions in open multi-agent systems in which agents, that are owned by a variety of stakeholders, can enter and leave the system at any time. This openness means existing trust and reputation models cannot readily be used. To this end, we present FIRE, a trust and reputation model that integrates a number of information sources to produce a comprehensive assessment of an agent's likely performance. Specifically, FIRE incorporates interaction trust, role-based trust, witness reputation, and certified reputation to provide a trust metric in most circumstances. FIRE is empirically benchmarked and is shown to help agents effectively select appropriate interaction partners.
Trust in multi-agent systems
, 2004
"... Trust is a fundamental concern in large-scale open distributed systems. It lies at the core of all interactions between the entities that have to operate in such uncertain and constantly changing environments. Given this complexity, these components, and the ensuing system, are increasingly being co ..."
Abstract
-
Cited by 182 (17 self)
- Add to MetaCart
Trust is a fundamental concern in large-scale open distributed systems. It lies at the core of all interactions between the entities that have to operate in such uncertain and constantly changing environments. Given this complexity, these components, and the ensuing system, are increasingly being conceptualised, designed, and built using agent-based techniques and, to this end, this paper examines the specific role of trust in multi-agent systems. In particular, we survey the state of the art and provide an account of the main directions along which research efforts are being focused. In so doing, we critically evaluate the relative strengths and weaknesses of the main models that have been proposed and show how, fundamentally, they all seek to minimise the uncertainty in interactions. Finally, we outline the areas that require further research in order to develop a comprehensive treatment of trust in complex computational settings.
FIRE: An Integrated Trust and Reputation Model for Open Multi-Agent Systems
- In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI
, 2004
"... Trust and reputation are central to effective interactions in open multi-agent systems in which agents, that are owned by a variety of stakeholders, can enter and leave the system at any time. This openness means existing trust and reputation models cannot readily be used. To this end, we present FI ..."
Abstract
-
Cited by 65 (1 self)
- Add to MetaCart
(Show Context)
Trust and reputation are central to effective interactions in open multi-agent systems in which agents, that are owned by a variety of stakeholders, can enter and leave the system at any time. This openness means existing trust and reputation models cannot readily be used. To this end, we present FIRE, a trust and reputation model that integrates a number of information sources to produce a comprehensive assessment of an agent's likely performance. Specifically, FIRE incorporates interaction trust, role-based trust, witness reputation, and certified reputation to provide a trust metric in virtually all circumstances. FIRE is empirically benchmarked and is shown to help agents effectively select appropriate interaction partners.
Operators for Propagating Trust and their Evaluation in Social Networks
, 2008
"... Trust is a crucial basis for interactions among parties in large, open systems. Yet, the scale and dynamism of such systems make it infeasible for each party to have a direct basis for trusting another party. For this reason, the participants in an open system must share information about trust. How ..."
Abstract
-
Cited by 59 (20 self)
- Add to MetaCart
(Show Context)
Trust is a crucial basis for interactions among parties in large, open systems. Yet, the scale and dynamism of such systems make it infeasible for each party to have a direct basis for trusting another party. For this reason, the participants in an open system must share information about trust. However, they should not automatically trust such shared information. This paper studies the problem of propagating trust in multiagent systems. It describes a new algebraic approach, shows some theoretical properties of it, and empirically evaluates it on two social network datasets. This evaluation incorporates a new methodology that involves dealing with opinions in an evidential setting. 1
The network of innovators in Jena: An application of social network analysis
- Research Policy
, 2006
"... First draft- Please do not cite without permission of the authors We apply social network analysis methods to describe the evolution of the innovator network of Jena, Germany in the period from 1995 to 2001. We find this evolution to be directed towards an increasing focus on core competencies of th ..."
Abstract
-
Cited by 52 (6 self)
- Add to MetaCart
First draft- Please do not cite without permission of the authors We apply social network analysis methods to describe the evolution of the innovator network of Jena, Germany in the period from 1995 to 2001. We find this evolution to be directed towards an increasing focus on core competencies of the local innovation system. Further we analyze the network resulting from R&D cooperations and explain- by means of network regression techniques- that the job mobility of scientists and the technological overlap between the actors, rather than past cooperations, can best predict the resulting structure. We also observe an increasing importance of the university while the former “Kombinate ” begin to lose their prominent role.
Semantic association identification and knowledge discovery for national security applications
- J. Database Management
, 2005
"... Abstract. Public and private organizations have access to vast amount of internal, deep Web and open Web information. Transforming this heterogeneous and distributed information into actionable and insightful information is the key to the emerging new class of business intelligence and national secu ..."
Abstract
-
Cited by 39 (17 self)
- Add to MetaCart
(Show Context)
Abstract. Public and private organizations have access to vast amount of internal, deep Web and open Web information. Transforming this heterogeneous and distributed information into actionable and insightful information is the key to the emerging new class of business intelligence and national security applications. Although role of semantics in search and integration has been often talked about, in this paper we discussed semantic approaches to support analytics on vast amount of heterogeneous data. In particular, we bring together novel academic research and commercialized Semantic Web technology. The academic research related to semantic association identification, is built upon commercial Semantic Web technology for semantic metadata extraction. A prototypical demonstration of this research and technology is presented in the context of an aviation security application of significance to national security.
Query Incentive Networks
- Proc. 46th IEEE Symposium on Foundations of Computer Science
, 2005
"... The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in understanding networks of interacting agents as economic systems. Here we formulate a model for query incentive networks, ..."
Abstract
-
Cited by 38 (4 self)
- Add to MetaCart
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in understanding networks of interacting agents as economic systems. Here we formulate a model for query incentive networks, motivated by such systems: users seeking information or services can pose queries, together with incentives for answering them, that are propagated along paths in the network. This type of information-seeking process can be formulated as a game among the nodes in the network, and this game has a natural Nash equilibrium. In such systems, it is a fundamental question to understand how much incentive is needed in order for a node to achieve a reasonable probability of extracting an answer to a query from the network. We study the size of query incentives as a function both of the rarity of the answer and the structure of the underlying network. This leads to natural questions related to strategic behavior in branching processes. Whereas the classically studied criticality of branching processes is centered around the region where the branching parameter is 1, we show in contrast that strategic interaction in incentive propagation exhibits critical behavior when the branching parameter is 2.
Coordinating Multiple Concurrent Negotiations
"... To secure good deals, an agent may engage in multiple concurrent negotiations for a particular good or service. However for this to be effective, the agent needs to carefully coordinate its negotiations. At a basic level, such coordination should ensure the agent does not procure more of the good th ..."
Abstract
-
Cited by 33 (4 self)
- Add to MetaCart
To secure good deals, an agent may engage in multiple concurrent negotiations for a particular good or service. However for this to be effective, the agent needs to carefully coordinate its negotiations. At a basic level, such coordination should ensure the agent does not procure more of the good than is needed. But to really derive benefit from such an approach, the agent needs the concurrent encounters to mutually influence one another (e.g. a good price with one opponent should enable an agent to negotiate more strongly in the other interactions). To this end, this paper presents a novel heuristic model for coordinating multiple bilateral negotiations. The model is empirically evaluated and shown to be effective and robust in a range of negotiation scenarios. 1.
Emergent Properties of Referral Systems
, 2003
"... Agents must decide with whom to interact, which is nontrivial when no central directories are available. A classical decentralized approach is referral systems, where agents adaptively give referrals to one another. We study the emergent properties of referral systems, especially those dealing with ..."
Abstract
-
Cited by 33 (9 self)
- Add to MetaCart
Agents must decide with whom to interact, which is nontrivial when no central directories are available. A classical decentralized approach is referral systems, where agents adaptively give referrals to one another. We study the emergent properties of referral systems, especially those dealing with their quality, efficiency, and structure. Our key findings are (1) pathological graph structures can emerge due to some neighbor selection policies and (2) if these are avoided, quality and efficiency depend on referral policies. Further, authorities emerge automatically and the extent of their relative authoritativeness depends on the policies.
Searching For Expertise in Social Networks: A Simulation of Potential Strategies
- Proc. of the 2005 Int. ACM SIGGROUP conf. on Supporting Group Work
, 2005
"... People search for people with suitable expertise all of the time in their social networks – to answer questions or provide help. Recently, efforts have been made to augment this searching. However, relatively little is known about the social characteristics of various algorithms that might be useful ..."
Abstract
-
Cited by 31 (1 self)
- Add to MetaCart
(Show Context)
People search for people with suitable expertise all of the time in their social networks – to answer questions or provide help. Recently, efforts have been made to augment this searching. However, relatively little is known about the social characteristics of various algorithms that might be useful. In this paper, we examine three families of searching strategies that we believe may be useful in expertise location. We do so through a simulation, based on the Enron email data set. (We would be unable to suitably experiment in a real organization, thus our need for a simulation.) Our emphasis is not on graph theoretical concerns, but on the social characteristics involved. The goal is to understand the tradeoffs involved in the design of social network based searching engines.