Related papers: Efficient liability assignment under shock propaga…

Two simple agent based models are often employed in epidemic studies: the susceptible-infected (SI) and the susceptible-infected-susceptible (SIS). Both models describe the time evolution of infectious diseases in networks in which vertices…

Understanding cascading failures or epidemics in networks is crucial for developing effective defensive mechanisms for many critical systems and infrastructures (e.g. biological, social and cyber networks). Most of the existing works treat…

We investigate the containment of epidemic spreading in networks from a normative point of view. We consider a susceptible/infected model in which agents can invest in order to reduce the contagiousness of network links. In this setting, we…

The DebtRank algorithm has been increasingly investigated as a method to estimate the impact of shocks in financial networks, as it overcomes the limitations of the traditional default-cascade approaches. Here we formulate a dynamical…

This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing. In the self-interested routing policy each agent selects a path that optimizes…

We consider a financial network represented at any time instance by a random liability graph which evolves over time. The agents connect through credit instruments borrowed from each other or through direct lending, and these create the…

We introduce and study a model stemming from game theory for the spread of an epidemic throughout a given population. Each agent is allowed to choose an action whose value dictates to what extent they limit their social interactions, if at…

We propose an efficient and accurate measure for ranking spreaders and identifying the influential ones in spreading processes in networks. While the edges determine the connections among the nodes, their specific role in spreading should…

In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and…

We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…

We propose a game-theoretic framework to study the outcomes of packetized payments, a cross-ledger transaction protocol, with strategic and possibly malicious agents. We derive the transaction failure rate and demonstrate that without…

We study the incentives that agents have to invest in costly protection against cascading failures in networked systems. Applications include vaccination, computer security and airport security. Agents are connected through a network and…

In this paper we describe a decision process framework allowing an agent to decide what information it should reveal to its neighbours within a communication graph in order to maximise its utility. We assume that these neighbours can pass…

We study the design of optimal incentives in sequential processes. To do so, we consider a basic and fundamental model in which an agent initiates a value-creating sequential process through costly investment with random success. If…

An important aspect in jointly analysing networked control systems and their communication is to model the networking in a sufficiently rich but at the same time mathematically tractable way. As such, this paper improves on a recently…

This paper describes an agent-based model of interacting firms, in which interacting firm agents rationally invest capital and labor in order to maximize payoff. Both transactions and production are taken into account in this model. First,…

Using the growing volumes of vehicle trajectory data, it becomes increasingly possible to capture time-varying and uncertain travel costs in a road network, including travel time and fuel consumption. The current paradigm represents a road…

We consider a dynamical model of distress propagation on complex networks, which we apply to the study of financial contagion in networks of banks connected to each other by direct exposures. The model that we consider is an extension of…

In this paper, we study a model reduction technique for leader-follower networked multi-agent systems defined on weighted, undirected graphs with arbitrary linear multivariable agent dynamics. In the network graph of this network, nodes…

In this paper, we study a distributed parameter estimation problem with an asynchronous communication protocol over multi-agent systems. Different from traditional time-driven communication schemes, in this work, data can be transmitted…