Integrating trust measures in multiagent systems

Several models have been proposed in the past for representing both reliability and reputation. However, we remark that a crucial point in the practical use of these two measures is represented by the possibility of suitably combining them to support the agent's decision. In the past, we proposed a reliability–reputation model, called RRAF, that allows the user to choose how much importance to give to the reliability with respect to the reputation. However, RRAF shows some limitations, namely: (i) The weight to assign to the reliability versus reputation is arbitrarily set by the user, without considering the system evolution; (ii) the trust measure that an agent a perceives about an agent b is completely independent of the trust measure perceived by each other agent c, while in the reality the trust measures are mutually dependent. In this paper, we propose an extension of RRAF, aiming at facing the limitations above. In particular, we introduce a new trust reputation model, called TRR, that considers, from a mathematical viewpoint, the interdependence among all the trust measures computed in the systems. Moreover, this model dynamically computes a parameter measuring the importance of the reliability with respect to the reputation. Some experiments performed on the well‐known ART(Agent Reputation and Trust) platform show the significant advantages in terms of effectiveness introduced by TRR with respect to RRAF. © 2011 Wiley Periodicals, Inc.     

An authorization-based trust model for multiagent systems

In this paper an authorization-based trust model (ABTM) is described which is designed for managing access to services in a semi-open distributed environment. This is called a multiagent-based smart office environment. In this model, "trust" is defined as a set of authorization attributes that are granted by the owner of a service to the user of the service. Central to this model is a trust manager that redelegates authorizations from the service owner to the requesting user, based on access control policies that are specified by role labels which are assigned to a set of agents. The ABTM scheme is different from a centralized scheme, in which authorizations are granted directly by an authority. It is also different from a fully distributed system,where authorizations are granted based solely on the discretion of the owner of the services. The design philosophy is the separation of trust management and trust application to allow efficient management of access control in large-scale and dynamic environment, such as those that exist in multiagent systems.     

Using asymmetric keys in a certified trust model for multiagent systems

We present a contribution based on encryption to the model for the certification of trust in multiagent systems. The originality of the proposal remains in the use of asymmetric keys that allow the local storage of testimonies with the service agents that were assessed. The aim is to raise the level of efficiency that client agents have when contracting specialized service agents. To reach this objective we make three hypotheses: (i) client agents are able to measure and inform the quality of a service they receive from a service agent; (ii) distributed certificate control is possible if every service agent stores the certificates it receives from its client agents and, (iii) the content of a certificate can be considered safe as long as the public and private keys used to encrypt the certificate remain safe. This approach reduces some weak points of trust models that rely on the direct interaction between service and client agents (direct trust) or those that rely on testimony obtained from client agents (propagated trust). Simulation showed that encrypted certificates of trust improved the efficiency of client agents when choosing their service provider agents. The reason seems to be that the reputation of a given service provider agent is based on the reputation it has among the totality of client agents that used its services.     

A familiarity-based trust model for effective selection of sellers in multiagent e-commerce systems

In electronic marketplaces, trust is modeled, for instance, in order to allow buying agents to make effective selection of selling agents. Familiarity is often considered to be an important factor in determining the level of trust. In previous research, familiarity between two agents has been simply assumed to be the similarity between them. We propose an improved familiarity measurement based on the exploration of factors that affect a human’s feelings of familiarity. We also carry out experiments to show that the trust model with our improved familiarity measurement is more effective and more stable.     

利用信任管理提高网格安全

网格计算系统是一个分布式的高性能计算机环境,由广域分布的异构的计算机和资源组成,目的是让用户透明的使用这些资源,为保证共享合作更加安全可靠,提出了信任的概念.信任管理是一种适用于大规模的、开放的分布式系统的授权机制.广义上讲,信任分为执行信任和代码信任.提出了一种信任管理的框架来提高网格的安全性,这种新的信任模型能捕获网格系统中存在的不同类型的信任关系,还提供了信任评价,信任推荐和信任更新的机制.     

Genetic fuzzy systems to evolve interaction strategies in multiagent systems

This article suggests an evolutionary approach to designing interaction strategies for multiagent systems, focusing on strategies modeled as fuzzy rule‐based systems. The aim is to learn models evolving database and rule bases to improve agent performance when playing in a competitive environment. In competitive situations, data for learning and tuning are rare, and rule bases must jointly evolve with the databases. We introduce an evolutionary algorithm whose operators use variable length chromosomes, a hierarchical relationship among individuals through fitness, and a scheme that successively explores and exploits the search space along generations. Evolution of interaction strategies uncovers unknown and unexpected agent behaviors and allows a richer analysis of negotiation mechanisms and their role as a coordination protocol. An application concerning an electricity market illustrates the effectiveness of the approach. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 971–991, 2007.     

Opportunities for multiagent systems and multiagent reinforcement learning in traffic control

The increasing demand for mobility in our society poses various challenges to traffic engineering, computer science in general, and artificial intelligence and multiagent systems in particular. As it is often the case, it is not possible to provide additional capacity, so that a more efficient use of the available transportation infrastructure is necessary. This relates closely to multiagent systems as many problems in traffic management and control are inherently distributed. Also, many actors in a transportation system fit very well the concept of autonomous agents: the driver, the pedestrian, the traffic expert; in some cases, also the intersection and the traffic signal controller can be regarded as an autonomous agent. However, the “agentification” of a transportation system is associated with some challenging issues: the number of agents is high, typically agents are highly adaptive, they react to changes in the environment at individual level but cause an unpredictable collective pattern, and act in a highly coupled environment. Therefore, this domain poses many challenges for standard techniques from multiagent systems such as coordination and learning. This paper has two main objectives: (i) to present problems, methods, approaches and practices in traffic engineering (especially regarding traffic signal control); and (ii) to highlight open problems and challenges so that future research in multiagent systems can address them.     

MobileTrust: a trust enhanced security architecture for mobile agent systems

While offering many practical benefits for distributed applications, mobile agent systems pose some fundamental security challenges. In this paper, we present a new approach to mobile agent security which helps to address some of these challenges. We present a new technique, which we refer to as trust enhanced security, and apply it to mobile agent-based systems; this new technique advocates a shift in security solutions from security-centric to trust-centric. This extends the traditional security mechanisms by enabling trust decisions through explicit specification and management of security-related trust relationships. The integration of the trust decisions into security decision-making process leads to our trust enhanced security performance. A formal trust model is proposed and is incorporated into the development of a novel trust management architecture—MobileTrust for mobile agent-based applications. We have conducted detailed practical investigations to evaluate and validate the emergent properties of the trust enhanced security technique. We present and discuss the key results in this paper.     

Declarative representations of multiagent systems

This paper explores the specification and semantics of multiagent problem-solving systems, focusing on the representations that agents have of each other. It provides a declarative representation for such systems. Several procedural solutions to a well-known test-bed problem are considered, and the requirements they impose on different agents are identified. A study of these requirements yields a representational scheme based on temporal logic for specifying the acting, perceiving, communicating, and reasoning abilities of computational agents. A formal semantics is provided for this scheme. The resulting representation is highly declarative, and useful for describing systems of agents solving problems reactively     

Controllability of heterogeneous multiagent systems

The existing results on controllability of multiagent systems (MASs) are mostly based on homogeneous nodes. This paper focuses on controllability of heterogeneous MASs, where the agents are modeled as two types. One type is that the agents have the same high‐order dynamics, and the interconnection topologies of the information flow in different orders are supposed to be different; the other type is that the agents have generic linear dynamics, and the dynamics are supposed to be heterogeneous. For the first type, the necessary and sufficient condition for controllability of heterogeneous‐topology system is derived via combination of Laplacian matrices. For the second type, the contribution also has two parts. The first part supposes that the agents have the same dimensional states and proves that controllability of this kind of MASs is equivalent to the controllability of each node and the whole interconnection topology, while the last parameter of the state feedback vector must not be 0. The second part supposes that the agents may have different dimensional states. For this kind of systems, the concept of β‐controllability is proposed. The necessary and sufficient condition for β‐controllability of heterogeneous‐dynamic systems is also derived and it is also proved that the feedback gain vectors have the effect to improve controllability. Different illustrative examples are provided to demonstrate the effectiveness of the theoretical results in this paper.     

Visualization and debugging of distributed multiagent systems

Visualizing the behavior of systems with distributed data, control, and process is a notoriously difficult task. Each component in the distributed system has only a local view of the whole setup, and the onus is on the user to integrate, into a coherent whole, the large amounts of limited information they provide. In this article, we describe an architecture and an implemented system for visualizing and controlling distributed multiagent applications. The system comprises a suite of tools, with each tool providing a different perspective of the application being visualized . Each tool interrogates the components of the distributed application, collates the returned information, and presents this information to users in an appropriate manner. This in essence, shifts the burden ofinference from the user to the visualizer. Our visualizer has been evaluated on four distributed multiagent systems: a travel management application, a telecommunications network management application, a business process management demonstrator, and an electronic commerce application. Lastly, we briefly show how the suite of tools can be used together for debugging multiagent applications - a process we refer to as debugging via corroboration.     

Introduction to the special issue on normative multiagent systems

This special issue contains four selected and revised papers from the second international workshop on normative multiagent systems, for short NorMAS07 (Boella et al. (eds) Normative multiagent systems. Dagstuhl seminar proceedings 07122, 2007), held at Schloss Dagstuhl, Germany, in March 2007. At the workshop a shift was identified in the research community from a legal to an interactionist view on normative multiagent systems. In this editorial we discuss the shift, examples, and 10 new challenges in this more dynamic setting, which we use to introduce the papers of this special issue.     

分布式网络系统的任意预设时间分组一致

研究任意预设时间控制下的多智能体网络系统分组一致性问题.设计非零分组投影参数下任意预设时间控制协议,使得分布式网络系统在物理允许范围内的任意预设时间内迅速实现分组一致,该预设时间与系统参数和初始值都无关系.基于代数图论、李雅普诺夫稳定性和矩阵理论等,分别讨论无向和有向拓扑网络情形下,多智能体系统实现预设时间分组一致的充分条件.独轮车的多智能体系统仿真实验验证了所提方法的有效性.     

Strategic best-response learning in multiagent systems

We present a novel and uniform formulation of the problem of reinforcement learning against bounded memory adaptive adversaries in repeated games, and the methodologies to accomplish learning in this novel framework. First we delineate a novel strategic definition of best response that optimises rewards over multiple steps, as opposed to the notion of tactical best response in game theory. We show that the problem of learning a strategic best response reduces to that of learning an optimal policy in a Markov Decision Process (MDP). We deal with both finite and infinite horizon versions of this problem. We adapt an existing Monte Carlo based algorithm for learning optimal policies in such MDPs over finite horizon, in polynomial time. We show that this new efficient algorithm can obtain higher average rewards than a previously known efficient algorithm against some opponents in the contract game. Though this improvement comes at the cost of increased domain knowledge, simple experiments in the Prisoner's Dilemma, and coordination games show that even when no extra domain knowledge (besides that an upper bound on the opponent's memory size is known) is assumed, the error can still be small. We also experiment with a general infinite-horizon learner (using function-approximation to tackle the complexity of history space) against a greedy bounded memory opponent and show that while it can create and exploit opportunities of mutual cooperation in the Prisoner's Dilemma game, it is cautious enough to ensure minimax payoffs in the Rock–Scissors–Paper game.     

A platform-independent metamodel for multiagent systems

Various agent-oriented methodologies and metamodels exist to design and develop multiagent systems (MAS) in an abstract manner. Frequently, these frameworks specialise on particular parts of the MAS and only few works have been invested to derive a common standardisation. This limits the impact of agent-related systems in commercial applications. In this paper, we present a metamodel for agent systems that abstracts from existing agent-oriented methodologies, programming languages, and platforms and could thus be considered as platform-independent. This metamodel defines the abstract syntax of a proposed domain-specific modelling language for MAS that is currently under development and provides furthermore the base to generate code out of the generated designs. This is done by applying the principles of model-driven development (MDD) and providing two model transformations that allow transforming the generated models into textual code that can be executed with JACK and JADE.     

Communication in reactive multiagent robotic systems

Multiple cooperating robots are able to complete many tasks more quickly and reliably than one robot alone. Communication between the robots can multiply their capabilities and effectiveness, but to what extent? In this research, the importance of communication in robotic societies is investigated through experiments on both simulated and real robots. Performance was measured for three different types of communication for three different tasks. The levels of communication are progressively more complex and potentially more expensive to implement. For some tasks, communication can significantly improve performance, but for others inter-agent communication is apparently unnecessary. In cases where communication helps, the lowest level of communication is almost as effective as the more complex type. The bulk of these results are derived from thousands of simulations run with randomly generated initial conditions. The simulation results help determine appropriate parameters for the reactive control system which was ported for tests on Denning mobile robots.     

Modelling social norms in multiagent systems

Social norms are cultural phenomena that naturally emerge in human societies and help to prescribe and proscribe normative patterns of behaviour. In recent times, the discipline of multi-agent systems has been used to model social norms in an artificial society of agents. In this paper we review norms in multi-agent systems and then explore a series of norms in a simulated urban traffic setting. Using game-theoretic concepts we define and offer an account of norm stability. Particularly in small groups, a relatively small number of individuals with cooperative attitude are needed for the norm of cooperation to evolve and be stable. In contrast, in larger populations, a larger proportion of cooperating individuals are required to achieve stability.