scholarly journals Rational verification: game-theoretic verification of multi-agent systems

2021 ◽  
Author(s):  
Alessandro Abate ◽  
Julian Gutierrez ◽  
Lewis Hammond ◽  
Paul Harrenstein ◽  
Marta Kwiatkowska ◽  
...  
Keyword(s):  
Computer Science ◽  
Temporal Logic ◽  
State Of The Art ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
The Past ◽  
Multi Agent ◽  
Game Theoretic ◽  
Temporal Logic Formula

AbstractWe provide a survey of the state of the art of rational verification: the problem of checking whether a given temporal logic formula ϕ is satisfied in some or all game-theoretic equilibria of a multi-agent system – that is, whether the system will exhibit the behavior ϕ represents under the assumption that agents within the system act rationally in pursuit of their preferences. After motivating and introducing the overall framework of rational verification, we discuss key results obtained in the past few years as well as relevant related work in logic, AI, and computer science.

scholarly journals On Partially Controlled Multi-Agent Systems

1996 ◽  
Vol 4 ◽  
pp. 477-507 ◽  
Author(s):  
R. I. Brafman ◽  
M. Tennenholtz
Keyword(s):  
Expected Utility ◽  
The Other ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Direct Control ◽  
Agent System ◽  
Agent Systems ◽  
Multi Agent ◽  
Game Theoretic

Motivated by the control theoretic distinction between controllable and uncontrollable events, we distinguish between two types of agents within a multi-agent system: controllable agents, which are directly controlled by the system's designer, and uncontrollable agents, which are not under the designer's direct control. We refer to such systems as partially controlled multi-agent systems, and we investigate how one might influence the behavior of the uncontrolled agents through appropriate design of the controlled agents. In particular, we wish to understand which problems are naturally described in these terms, what methods can be applied to influence the uncontrollable agents, the effectiveness of such methods, and whether similar methods work across different domains. Using a game-theoretic framework, this paper studies the design of partially controlled multi-agent systems in two contexts: in one context, the uncontrollable agents are expected utility maximizers, while in the other they are reinforcement learners. We suggest different techniques for controlling agents' behavior in each domain, assess their success, and examine their relationship.

ENABLING TECHNOLOGIES FOR THE CREATION AND RESTRUCTURING PROCESS OF EMERGENT ENTERPRISE ALLIANCES

2004 ◽  
Vol 03 (01) ◽  
pp. 33-60 ◽  
Author(s):  
MIHAELA ULIERU ◽  
RAINER UNLAND
Keyword(s):  
State Of The Art ◽  
Virtual Enterprise ◽  
Virtual Enterprises ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Agent System ◽  
Agent Systems ◽  
Restructuring Process ◽  
Multi Agent ◽  
Deep Integration

In today's world, it is of utterly importance for enterprises to react in a timely and flexible way to upcoming complex market demands. One solution is given by the concept of virtual enterprise and enterprise alliances, respectively. In order to function efficiently and flexibly such enterprises need to be deeply integrated. Based on previous work combining the concepts of virtual enterprises, holonic organizations and multi-agent systems to support such deep integration, the paper discusses in detail how well-suiting partners and contributors for a given (bunch of) task(s) can be found using today's state-of-the-art technologies. Mapping an enterprise alliance onto a multi-agent system is enabled by a methodology equipping each agent with the ability to deal and consider its own goals (goals of the unit it represents) as well as the goals of the unit in which it is integrated (the higher level unit).

scholarly journals Expressiveness and Nash Equilibrium in Iterated Boolean Games

2021 ◽  
Vol 22 (2) ◽  
pp. 1-38
Author(s):  
Julian Gutierrez ◽  
Paul Harrenstein ◽  
Giuseppe Perelli ◽  
Michael Wooldridge
Keyword(s):  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Infinite Sequence ◽  
Multi Agent Systems ◽  
Temporal Logics ◽  
Agent Systems ◽  
Temporal Properties ◽  
Multi Agent ◽  
Game Theoretic ◽  
Boolean Games

We define and investigate a novel notion of expressiveness for temporal logics that is based on game theoretic equilibria of multi-agent systems. We use iterated Boolean games as our abstract model of multi-agent systems [Gutierrez et al. 2013, 2015a]. In such a game, each agent  has a goal  , represented using (a fragment of) Linear Temporal Logic ( ) . The goal  captures agent  ’s preferences, in the sense that the models of  represent system behaviours that would satisfy  . Each player controls a subset of Boolean variables , and at each round in the game, player is at liberty to choose values for variables in any way that she sees fit. Play continues for an infinite sequence of rounds, and so as players act they collectively trace out a model for , which for every player will either satisfy or fail to satisfy their goal. Players are assumed to act strategically, taking into account the goals of other players, in an attempt to bring about computations satisfying their goal. In this setting, we apply the standard game-theoretic concept of (pure) Nash equilibria. The (possibly empty) set of Nash equilibria of an iterated Boolean game can be understood as inducing a set of computations, each computation representing one way the system could evolve if players chose strategies that together constitute a Nash equilibrium. Such a set of equilibrium computations expresses a temporal property—which may or may not be expressible within a particular fragment. The new notion of expressiveness that we formally define and investigate is then as follows: What temporal properties are characterised by the Nash equilibria of games in which agent goals are expressed in specific fragments of  ? We formally define and investigate this notion of expressiveness for a range of fragments. For example, a very natural question is the following: Suppose we have an iterated Boolean game in which every goal is represented using a particular fragment of : is it then always the case that the equilibria of the game can be characterised within ? We show that this is not true in general.

scholarly journals Multi-Agent Systems Applications in Energy Optimization Problems: A State-of-the-Art Review

Energies ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 1928 ◽  
Author(s):  
Alfonso González-Briones ◽  
Fernando De La Prieta ◽  
Mohd Mohamad ◽  
Sigeru Omatu ◽  
Juan Corchado
Keyword(s):  
Optimization Problems ◽  
State Of The Art ◽  
Smart Cities ◽  
Energy Optimization ◽  
Sensor Data ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Research Perspectives ◽  
Wide Range ◽  
Multi Agent

This article reviews the state-of-the-art developments in Multi-Agent Systems (MASs) and their application to energy optimization problems. This methodology and related tools have contributed to changes in various paradigms used in energy optimization. Behavior and interactions between agents are key elements that must be understood in order to model energy optimization solutions that are robust, scalable and context-aware. The concept of MAS is introduced in this paper and it is compared with traditional approaches in the development of energy optimization solutions. The different types of agent-based architectures are described, the role played by the environment is analysed and we look at how MAS recognizes the characteristics of the environment to adapt to it. Moreover, it is discussed how MAS can be used as tools that simulate the results of different actions aimed at reducing energy consumption. Then, we look at MAS as a tool that makes it easy to model and simulate certain behaviors. This modeling and simulation is easily extrapolated to the energy field, and can even evolve further within this field by using the Internet of Things (IoT) paradigm. Therefore, we can argue that MAS is a widespread approach in the field of energy optimization and that it is commonly used due to its capacity for the communication, coordination, cooperation of agents and the robustness that this methodology gives in assigning different tasks to agents. Finally, this article considers how MASs can be used for various purposes, from capturing sensor data to decision-making. We propose some research perspectives on the development of electrical optimization solutions through their development using MASs. In conclusion, we argue that researchers in the field of energy optimization should use multi-agent systems at those junctures where it is necessary to model energy efficiency solutions that involve a wide range of factors, as well as context independence that they can achieve through the addition of new agents or agent organizations, enabling the development of energy-efficient solutions for smart cities and intelligent buildings.

scholarly journals Trust in multi-agent systems

2004 ◽  
Vol 19 (1) ◽  
pp. 1-25 ◽  
Author(s):  
SARVAPALI D. RAMCHURN ◽  
DONG HUYNH ◽  
NICHOLAS R. JENNINGS
Keyword(s):  
Large Scale ◽  
State Of The Art ◽  
Comprehensive Treatment ◽  
Multi Agent Systems ◽  
Agent Based ◽  
Agent Systems ◽  
The Core ◽  
Open Distributed Systems ◽  
Multi Agent

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.

Evolutionary Computation as a Paradigm for Engineering Emergent Behaviour in Multi-Agent Systems

2011 ◽  
pp. 118-136 ◽  
Author(s):  
Robert E. Smith ◽  
Claudio Bonacina
Keyword(s):  
Evolutionary Computation ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Agent System ◽  
Future Directions ◽  
Agent Based ◽  
Agent Systems ◽  
Emergent Behaviour ◽  
Shaping System ◽  
Multi Agent

In the multi-agent system (MAS) context, the theories and practices of evolutionary computation (EC) have new implications, particularly with regard to engineering and shaping system behaviors. Thus, it is important that we consider the embodiment of EC in “real” agents, that is, agents that involve the real restrictions of time and space within MASs. In this chapter, we address these issues in three ways. First, we relate the foundations of EC theory to MAS and consider how general interactions among agents fit within this theory. Second, we introduce a platform independent agent system to assure that our EC methods work within the generic, but realistic, constraints of agents. Finally, we introduce an agent-based system of EC objects. Concluding sections discuss implications and future directions.

How Can We Trust Agents in Multi-Agent Environments? Techniques and Challenges

2009 ◽  
pp. 2843-2864 ◽  
Author(s):  
Kostas Kolomvatsos ◽  
Stathes Hadjiefthymiades
Keyword(s):  
Computer Science ◽  
Research Area ◽  
Software Components ◽  
Important Research ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Potential Partner ◽  
Multi Agent ◽  
Important Research Area

The field of Multi-agent systems (MAS) has been an active area for many years due to the importance that agents have to many disciplines of research in computer science. MAS are open and dynamic systems where a number of autonomous software components, called agents, communicate and cooperate in order to achieve their goals. In such systems, trust plays an important role. There must be a way for an agent to make sure that it can trust another entity, which is a potential partner. Without trust, agents cannot cooperate effectively and without cooperation they cannot fulfill their goals. Many times, trust is based on reputation. It is an indication that we may trust someone. This important research area is investigated in this book chapter. We discuss main issues concerning reputation and trust in MAS. We present research efforts and give formalizations useful for understanding the two concepts.

scholarly journals Quantum Diffie–Hellman Extended to Dynamic Quantum Group Key Agreement for e-Healthcare Multi-Agent Systems in Smart Cities

Sensors ◽  
2020 ◽  
Vol 20 (14) ◽  
pp. 3940
Author(s):  
Vankamamidi S. Naresh ◽  
Moustafa M. Nasralla ◽  
Sivaranjani Reddi ◽  
Iván García-Magariño
Keyword(s):  
System Architecture ◽  
Key Agreement ◽  
Unitary Operation ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Group Key ◽  
Group Key Agreement ◽  
Agent Systems ◽  
Diffie Hellman ◽  
Multi Agent

Multi-Agent Systems can support e-Healthcare applications for improving quality of life of citizens. In this direction, we propose a healthcare system architecture named smart healthcare city. First, we divide a given city into various zones and then we propose a zonal level three-layered system architecture. Further, for effectiveness we introduce a Multi-Agent System (MAS) in this three-layered architecture. Protecting sensitive health information of citizens is a major security concern. Group key agreement (GKA) is the corner stone for securely sharing the healthcare data among the healthcare stakeholders of the city. For establishing GKA, many efficient cryptosystems are available in the classical field. However, they are yet dependent on the supposition that some computational problems are infeasible. In light of quantum mechanics, a new field emerges to share a secret key among two or more members. The unbreakable and highly secure features of key agreement based on fundamental laws of physics allow us to propose a Quantum GKA (QGKA) technique based on renowned Quantum Diffie–Hellman (QDH). In this, a node acts as a Group Controller (GC) and forms 2-party groups with remaining nodes, establishing a QDH-style shared key per each two-party. It then joins these keys into a single group key by means of a XOR-operation, acting as a usual group node. Furthermore, we extend the QGKA to Dynamic QGKA (DQGKA) by adding join and leave protocol. Our protocol performance was compared with existing QGKA protocols in terms of Qubit efficiency (QE), unitary operation (UO), unitary operation efficiency (UOE), key consistency check (KCC), security against participants attack (SAP) and satisfactory results were obtained. The security analysis of the proposed technique is based on unconditional security of QDH. Moreover, it is secured against internal and external attack. In this way, e-healthcare Multi-Agent System can be robust against future quantum-based attacks.

Sign in / Sign up

Export Citation Format

Share Document