163 research outputs found

    Probabilistic modeling and reasoning in multiagent decision systems

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Agoric computation: trust and cyber-physical systems

    Get PDF
    In the past two decades advances in miniaturisation and economies of scale have led to the emergence of billions of connected components that have provided both a spur and a blueprint for the development of smart products acting in specialised environments which are uniquely identifiable, localisable, and capable of autonomy. Adopting the computational perspective of multi-agent systems (MAS) as a technological abstraction married with the engineering perspective of cyber-physical systems (CPS) has provided fertile ground for designing, developing and deploying software applications in smart automated context such as manufacturing, power grids, avionics, healthcare and logistics, capable of being decentralised, intelligent, reconfigurable, modular, flexible, robust, adaptive and responsive. Current agent technologies are, however, ill suited for information-based environments, making it difficult to formalise and implement multiagent systems based on inherently dynamical functional concepts such as trust and reliability, which present special challenges when scaling from small to large systems of agents. To overcome such challenges, it is useful to adopt a unified approach which we term agoric computation, integrating logical, mathematical and programming concepts towards the development of agent-based solutions based on recursive, compositional principles, where smaller systems feed via directed information flows into larger hierarchical systems that define their global environment. Considering information as an integral part of the environment naturally defines a web of operations where components of a systems are wired in some way and each set of inputs and outputs are allowed to carry some value. These operations are stateless abstractions and procedures that act on some stateful cells that cumulate partial information, and it is possible to compose such abstractions into higher-level ones, using a publish-and-subscribe interaction model that keeps track of update messages between abstractions and values in the data. In this thesis we review the logical and mathematical basis of such abstractions and take steps towards the software implementation of agoric modelling as a framework for simulation and verification of the reliability of increasingly complex systems, and report on experimental results related to a few select applications, such as stigmergic interaction in mobile robotics, integrating raw data into agent perceptions, trust and trustworthiness in orchestrated open systems, computing the epistemic cost of trust when reasoning in networks of agents seeded with contradictory information, and trust models for distributed ledgers in the Internet of Things (IoT); and provide a roadmap for future developments of our research

    Time constraint agents? coordination and learning in cooperative multi-agent system

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Modeling and Visualization of Competing Escalation Dynamics: A Multilayer Multiagent Network Approach

    Get PDF
    Recent advances in military technology, such as hypersonic missiles, which can travel at more than five times the speed of sound and descend quickly into the atmosphere, give world nuclear superpowers a new edge. These advances up the game for nuclear superpowers with an extremely rapid, intense burst of military striking capability to secure upfront gains before encountering potentially overwhelming military confrontation. However, this so-called fait accompli has not been systematically studied by the United States in the perspective of the escalation philosophies of nuclear power competitors, or the mathematical modeling and visualization of multi-modal escalation dynamics. This gap may hamper any further command and control for nuclear deployment and decision making for strategic planning in preparation of such scenarios. This thesis aims to bridge the gap by implementing a network approach to model the escalation dynamics among competing nuclear superpowers

    Collective decision-making with goals

    Get PDF
    Des agents devant prendre une décision collective sont souvent motivés par des buts individuels. Dans ces situations, deux aspects clés doivent être abordés : sélectionner une alternative gagnante à partir des voix des agents et s'assurer que les agents ne manipulent pas le résultat. Cette thèse étudie l'agrégation et la dimension stratégique des décisions collectives lorsque les agents utilisent un langage représenté de manière compacte. Nous étudions des langages de type logique : de la logique propositionnelle aux CP-nets généralisés, en passant par la logique temporelle linéaire (LTL). Notre principale contribution est l'introduction d'un cadre de vote sur les buts, dans lequel les agents soumettent des buts individuels exprimés comme des formules de la logique propositionnelle. Les fonctions d'agrégation classiques issues du vote, de l'agrégation de jugements et de la fusion de croyances sont adaptées et étudiées de manière axiomatique et computationnelle. Les propriétés axiomatiques connues dans la littérature sur la théorie du choix social sont généralisées à ce nouveau type d'entrée, ainsi que les problèmes de complexité visant à déterminer le résultat du vote. Une autre contribution importante est l'étude de l'agrégation des CP-nets généralisés, c'est-à-dire des CP-nets où la précondition de l'énoncé de préférence est une formule propositionnelle. Nous utilisons différents agrégateurs pour obtenir un classement collectif des résultats possibles. Grâce à cette thèse, deux axes de recherche sont ainsi reliés : l'agrégation des CP-nets classiques et la généralisation des CP-nets à des préconditions incomplètes. Nous contribuons également à l'étude du comportement stratégique dans des contextes de prise de décision collective et de théorie des jeux. Le cadre du vote basé sur les buts est de nouveau étudié sous l'hypothèse que les agents peuvent décider de mentir sur leur but s'ils obtiennent ainsi un meilleur résultat. L'accent est mis sur trois règles de vote majoritaires qui se révèlent manipulables. Par conséquent, nous étudions des restrictions à la fois sur le langage des buts et sur les stratégies des agents en vue d'obtenir des résultats de votes non manipulables. Nous présentons par ailleurs une extension stratégique d'un modèle récent de diffusion d'opinion sur des réseaux d'influence. Dans les jeux d'influence définis ici, les agents ont comme but des formules en LTL et ils peuvent choisir d'utiliser leur pouvoir d'influence pour s'assurer que leur but est atteint. Des solutions classiques telles que la stratégie gagnante sont étudiées pour les jeux d'influence, en relation avec la structure du réseau et les buts des agents. Enfin, nous introduisons une nouvelle classe de concurrent game structures (CGS) dans laquelle les agents peuvent avoir un contrôle partagé sur un ensemble de variables propositionnelles. De telles structures sont utilisées pour interpréter des formules de logique temporelle en temps alternés (ATL), grâce auxquelles on peut exprimer l'existence d'une stratégie gagnante pour un agent dans un jeu itéré (comme les jeux d'influence mentionnés ci-dessus). Le résultat principal montre qu'un CGS avec contrôle partagé peut être représenté comme un CGS avec contrôle exclusif. En conclusion, cette thèse contribue au domaine de la prise de décision collective en introduisant un nouveau cadre de vote basé sur des buts propositionnels. Elle présente une étude de l'agrégation des CP-nets généralisés et une extension d'un cadre de diffusion d'opinion avec des agents rationnels qui utilisent leur pouvoir d'influence. Une réduction du contrôle partagé à un contrôle exclusif dans les CGS pour l'interprétation des logiques du raisonnement stratégique est également proposée. Par le biais de langages logiques divers, les agents peuvent ainsi exprimer buts et préférences sur la décision à prendre, et les propriétés souhaitées pour le processus de décision peuvent en être garanties.Agents having to take a collective decision are often motivated by individual goals. In such scenarios, two key aspects need to be addressed. The first is defining how to select a winning alternative from the expressions of the agents. The second is making sure that agents will not manipulate the outcome. Agents should also be able to state their goals in a way that is expressive, yet not too burdensome. This dissertation studies the aggregation and the strategic component of multi-agent collective decisions where the agents use a compactly represented language. The languages we study are all related to logic: from propositional logic, to generalized CP-nets and linear temporal logic (LTL). Our main contribution is the introduction of the framework of goal-based voting, where agents submit individual goals expressed as formulas of propositional logic. Classical aggregation functions from voting, judgment aggregation, and belief merging are adapted to this setting and studied axiomatically and computationally. Desirable axiomatic properties known in the literature of social choice theory are generalized to this new type of propositional input, as well as the standard complexity problems aimed at determining the result. Another important contribution is the study of the aggregation of generalized CP-nets coming from multiple agents, i.e., CP-nets where the precondition of the preference statement is a propositional formula. We use different aggregators to obtain a collective ordering of the possible outcomes. Thanks to this thesis, two lines of research are thus bridged: the one on the aggregation of complete CP-nets, and the one on the generalization of CP-nets to incomplete preconditions. We also contribute to the study of strategic behavior in both collective decision-making and game-theoretic settings. The framework of goal-based voting is studied again under the assumption that agents can now decide to submit an untruthful goal if by doing so they can get a better outcome. The focus is on three majoritarian voting rules which are found to be manipulable. Therefore, we study restrictions on both the language of the goals and on the strategies allowed to the agents to discover islands of strategy-proofness. We also present a game-theoretic extension of a recent model of opinion diffusion over networks of influence. In the influence games defined here, agents hold goals expressed as formulas of LTL and they can choose whether to use their influence power to make sure that their goal is satisfied. Classical solution concepts such as weak dominance and winning strategy are studied for influence games, in relation to the structure of the network and the goals of the agents. Finally, we introduce a novel class of concurrent game structures (CGS) in which agents can have shared control over a set of propositional variables. Such structures are used for the interpretation of formulas of alternating-time temporal logic, thanks to which we can express the existence of a winning strategy for an agent in a repeated game (as, for instance, the influence games mentioned above). The main result shows by means of a clever construction that a CGS with shared control can be represented as a CGS with exclusive control. In conclusion, this thesis provides a valuable contribution to the field of collective decision-making by introducing a novel framework of voting based on individual propositional goals, it studies for the first time the aggregation of generalized CP-nets, it extends a framework of opinion diffusion by modelling rational agents who use their influence power as they see fit, and it provides a reduction of shared to exclusive control in CGS for the interpretation of logics of strategic reasoning. By using different logical languages, agents can thus express their goals and preferences over the decision to be taken, and desirable properties of the decision process can be ensured

    CloudAnchor Smart Contracts

    Get PDF
    The CloudAnchor platform allows the negotiation of IaaS Cloud resources for Small and Medium Sized Enterprises (SME), either as resource providers or consumers. This project entails the research, design, and implementation of a solution based on smart contracts, with the goal of permanently recording and managing the contracts on a blockchain network. The usage of smart contracts enables safe contract code execution and raises the level of trust, integrity, and traceability of the platform contracts by keeping the data stored in a decentralised manner. To do so, a method to coordinate and submit transactions to the blockchain network must be implemented. The tests carried out indicate that the solution has been successfully implemented, with contract registration saved in a decentralised and safe manner. As a result, there was an increase in the platform’s execution time, caused by the new transactions made to the blockchain.A plataforma CloudAnchor permite a negociação e contratualização de recursos Cloud do tipo IaaS a pequenas e médias empresas, sejam elas fornecedoras ou clientes. Este trabalho inclui o estudo, projeto e implementação de uma solução baseada em smart contracts, com o objetivo de administrar e registar de forma permanente os contratos celebrados numa rede blockchain. A utilização de smart contracts permite executar o respetivo código de forma segura e aumentar o nível de confiança, integridade e rastreabilidade dos contratos celebrados na plataforma, guardando-os de forma descentralizada. Para tal, é necessário implementar um mecanismo de coordenação e submissão de transações para a rede blockchain. Os testes realizados permitiram concluir que a implementação da solução foi bem sucedida, passando os contratos a ficar guardados de forma descentralizada e segura. Em consequência, verificou-se um aumento do tempo de execução da plataforma provocado pelas novas transações com a blockchain

    Multiagent resource allocation in service networks

    Get PDF
    The term service network (SN) denotes a network of software services in which complex software applications are provided to customers by aggregating multiple elementary services. These networks are based on the service-oriented computing (SOC) paradigm, which defines the fundamental technical concepts for software services over electronic networks, e.g., Web services and, most recently, Cloud services. For the provision of software services to customers, software service providers (SPs) have to allocate their scarce computational resources (i.e., hardware and software) of a certain quality to customer requests. The SOC paradigm facilitates interoperability over organizational boundaries by representing business relationships on the software system level. Composite software services aggregate multiple software services into software applications. This aggregation is denoted as service composition. The loose coupling of services leads to SNs as dynamic entities with changing interdependencies between services. For composite software services, these dependencies exist across SN tiers; they result from the procurement of services, which are themselves utilized to produce additional services, and constitute a major problem for resource allocation in SNs. If these dependencies are not considered, the fulfillment of agreements may become unaccomplishable (overcommitment). Hence, the consideration of service dependencies is crucial for the allocation of service providers resources to fulfill customer requests in SNs. However, existing resource allocation methods, which could consider these dependencies -- such as combinatorial auctions with a central auctioneer for the whole SN -- are not applicable, since there are no central coordinating entities in SNs. The application of an allocation mechanism that does not consider these dependencies might negatively affect the actual service delivery; results are penalty payments as well as a damage to the reputation of the providers. This research is conducted in accordance to the design science paradigm in information system research. It is a problem-solving paradigm, which targets the construction and evaluation of IT artifacts. The objectives of this research are to develop and evaluate an allocation protocol, which can consider multi-tier service dependencies without the existence of central coordinating entities. Therefore, an interaction protocol engineering (IPE) perspective is applied to solve the problem of multi-tier dependencies in resource allocation. This approach provides a procedure model for designing interaction protocols for multiagent systems, and is closely related to the well-established area of communication protocol engineering. Automated resource allocation in SNs is analyzed in this research by representing the actors as autonomous software agents in the software system. The actors delegate their objectives to their software agents, which conduct the negotiations for service provision on their behalf. Thus, these agents communicate concerning the resource allocation; in this process, the sequence of communication interactions is crucial to the problem addressed. Interaction protocols define a structured exchange of defined messages between agents; they facilitate agent conversations. When multiple agents have to reach agreements by negotiation and bargaining, such as in case with allocating scarce resources, game theory provides means to formalize and analyze the most rational choice of actions for the interacting agents. Based on a formal framework for resource allocation in SNs, this research first performs a game-theoretic problem analysis; it is concerned with the existence, as well as the complexity of computing optimal allocations. In addition, Nash equilibria are analyzed for optimal allocations. Second, a distributed, auction-based allocation protocol, which prevents overcommitments and guarantees socially optimal allocations for single customer requests under certain assumptions, is proposed. Therefore, a game-theoretic model and an operationizable specification of the protocol are presented. Third, it is formally verified that the protocol enables multi-tier resource allocation and avoids overcommitments by proofs for the game-theoretic model and by model checking for the interaction protocol specification; using the model checker Spin, safety properties like the absence of deadlock are as well formally verified as the protocol enabling multi-tier resource allocation. Fourth, the efficacy and the benefits of the proposed protocol are demonstrated by multiagent simulation for concurrent customers. The experimental evaluation provides evidence of the protocols efficiency compared to the socially optimal allocation as a centralized benchmark in different settings, e.g., network topologies and different bidding policies.Der Begriff Service Network (SN) bezeichnet ein Netzwerk von Software-Services, in dem komplexe Software-Applikationen durch Aggregation mehrerer elementarer Services für Kunden bereitgestellt werden. Diese Netzwerke basieren auf dem Paradigma des Service-oriented Computing, welches die grundlegenden technischen Konzepte für Software-Services über elektronische Netzwerke bereitstellt, d.h. Web Services und zuletzt Cloud-Computing. Für die Bereitstellung von Software-Services für Kunden müssen Software-Anbieter ihre knappen Ressourcen (d.h. Hardware und Software) einer bestimmten Qualität zu Kundenanfragen allozieren, also entsprechende Ressourcen reservieren, um Software-Services in der vereinbarten Dienstgüte bereitzustellen. Zusammengesetzte Software-Services aggregieren mehrere Software-Services zu Software-Applikations-Services. Diese Aggregation wird als Service-Komposition bezeichnet. Die lose Kopplung von Services macht SNs zu dynamischen Entitäten mit sich verändernden Interdependenzen zwischen den Services. Für zusammengesetzte Software-Services existieren solche Abhängigkeiten über mehrere SN-Stufen; sie ergeben sich durch die Beschaffung von Services, welche für die Produktion von weiteren Services verwendet werden, und stellen ein Hauptproblem bei der Ressourcenallokation in SN dar. Werden diese Abhängigkeiten nicht berücksichtigt, kann die Erfüllung von Vereinbarungen undurchführbar werden (overcommitment). Daher ist die Berücksichtigung von Service-Abhängigkeiten bei der Allokation von Ressourcen der Service-Anbieter für die Erfüllung der Kundenanfragen in SNs entscheidend. Existierende Methoden der Ressourcenallokation, welche diese Abhängigkeiten berücksichtigen könnten -- wie kombinatorische Auktionen mit einem zentralen Auktionator für das gesamte SN -- sind jedoch nicht anwendbar, da in SNs keine zentralen Koordinationsentitäten existieren. Der Einsatz eines Allokationsmechanismus, welcher diese Abhängigkeiten nicht berücksichtigt, kann die konkrete Service-Erbringung negativ beeinflussen und somit in Strafzahlungen und einer Beeinträchtigung der Reputation der Service-Anbieter resultieren. Die vorliegende Forschungsarbeit wird in Übereinstimmung mit dem Design Science-Paradigma durchgeführt. Dabei handelt es sich um ein Problemlösungs-Paradigma, welches die Konstruktion und Evaluation von IT-Artefakten zum Ziel hat. Ziel dieser Forschungsarbeit ist die Entwicklung und Evaluation eines Allokationsprotokolls, welches mehrstufige Service-Abhängigkeiten ohne die Existenz zentraler, koordinierender Entitäten berücksichtigen kann. Zu diesem Zweck wird eine Interaction-Protocol-Engineering (IPE)-Perspektive eingenommen, um das Problem mehrstufiger Abhängigkeiten bei der Ressourcenallokation zu lösen. Dieser Ansatz stellt ein Vorgehensmodell für den Entwurf von Interaktionsprotokollen für Multiagentensysteme zur Verfügung. Diese Forschungsarbeit analysiert die automatisierte Ressourcenallokation in SNs durch die Repräsentation der Akteure als autonome Softwareagenten im Softwaresystem. Die Akteure delegieren ihre Ziele an ihre Softwareagenten, welche in deren Auftrag die Verhandlung für die Service-Erbringung durchführen. Somit kommunizieren diese Softwareagenten bezüglich der Ressourcenallokationen; dabei ist die Abfolge der Interaktionen für das adressierte Problem elementar. Interaktionsprotokolle definieren einen strukturierten Austausch bestimmter Nachrichten zwischen Agenten. Wenn mehrere Agenten Vereinbarungen durch Verhandlungen treffen müssen, wie im Falle der Allokation knapper Ressourcen, stellt die Spieltheorie Methoden bereit, um rationale Entscheidungen der Aktionen für interagierende Agenten zu analysieren. Basierend auf einem formalen Modell für Ressourcenallokation in SN führt diese Forschungsarbeit eine spieltheoretische Problemanalyse durch. Hierbei werden insbesondere mehrstufige Abhängigkeiten von Vereinbarungen berücksichtigt. Die Problemanalyse befaßt sich mit der Existenz sowie der Komplexität der Berechnung optimaler Allokationen. Es wird ein verteiltes, Auktions-basiertes Allokationsprotokoll, welches overcommitments vermeidet, vorgeschlagen. Basierend auf dem spieltheoretischen Modell wird gezeigt, daß das vorgeschlagene Protokoll overcommitments vermeidet und sozial optimale Allokationen für einzelne Kundenanfragen unter bestimmten Annahmen garantiert. Darüber hinaus wird der Modellprüfer Spin verwendet, um bestimmte formale Eigenschaften der Beschreibung des Protokolls zu beweisen. Abschließend werden die Anwendbarkeit und der Nutzen des vorgeschlagenen Protokolls mittels Multiagentensimulation demonstriert. In den Simulationsexperimenten wird die Effizienz des Protokolls mit der optimalen Allokation als zentralisiertes Benchmark in unterschiedlichen Einstellungen (z.B. Netzwerktopologien oder Anzahl von Kunden- und Anbieter-Agenten) für verschiedene Bietrichtlinien für Anbieter verglichen

    Second Workshop on Modelling of Objects, Components and Agents

    Get PDF
    This report contains the proceedings of the workshop Modelling of Objects, Components, and Agents (MOCA'02), August 26-27, 2002.The workshop is organized by the 'Coloured Petri Net' Group at the University of Aarhus, Denmark and the 'Theoretical Foundations of Computer Science' Group at the University of Hamburg, Germany. The homepage of the workshop is: http://www.daimi.au.dk/CPnets/workshop02
    corecore