Related papers: A simplicial complex model of dynamic epistemic lo…
This paper presents a two-dimensional modal logic for reasoning about the changing patterns of knowledge and social relationships in networks organised on the basis of a symmetric 'friendship' relation, providing a precise language for…
As an alternative to Kripke models, simplicial complexes are a versatile semantic primitive on which to interpret epistemic logic. Given a set of vertices, a simplicial complex is a downward closed set of subsets, called simplexes, of the…
The development of intelligent agents, particularly those powered by language models (LMs), has shown a critical role in various environments that require intelligent and autonomous decision-making. Environments are not passive testing…
In this paper, we present the benefits of exploring different topologies with equal connectivity measure, or iso-connectivity topologies, in relation to the multiagent system dynamics. The level of global information sharing ability among…
Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks. In this logic, the agent's knowledge is captured by modal epistemic operators whereas the system…
In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific…
Agent-based models are a natural choice for modeling complex social systems. In such models simple stochastic interaction rules for a large population of individuals can lead to emergent dynamics on the macroscopic scale, for instance a…
In this paper, the synchronization of heterogeneous agents interacting over a dynamical network is studied. The edge dynamics can model the inter-agent communications which are often heterogeneous by nature. They can also model the…
Impure simplicial complexes are a powerful tool to model multi-agent epistemic situations where agents may die, but it is difficult to define a satisfactory semantics for the ordinary propositional modal language on such models, since many…
We develop a modeling technique based on interpreted systems in order to verify temporal-epistemic properties over access control policies. This approach enables us to detect information flow vulnerabilities in dynamic policies by verifying…
The paper investigates epistemic properties of information flow under communication protocols with a given topological structure of the communication network. The main result is a sound and complete logical system that describes all such…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…
This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These…
The most celebrated and extensively studied model of distributed computing is the {\em message-passing model,} in which each vertex/node of the (distributed network) graph corresponds to a static computational device that communicates with…
In this paper we study the problem of social learning under multiple true hypotheses and self-interested agents which exchange information over a graph. In this setup, each agent receives data that might be generated from a different…
Simplicial complexes constitute the underlying topology of interacting complex systems including among the others brain and social interaction networks. They are generalized network structures that allow to go beyond the framework of…
Recent studies on network geometry, a way of describing network structures as geometrical objects, are revolutionizing our way to understand dynamical processes on networked systems. Here, we cope with the problem of epidemic spreading,…
We focus at the interface between multiscale computations, bifurcation theory and social networks. In particular we address how the Equation-Free approach, a recently developed computational framework, can be exploited to systematically…
Simplicial models have become a crucial tool for studying distributed computing. These models, however, are only able to account for the knowledge, but not for the beliefs of agents. We present a new semantics for logics of belief. Our…
Agents are a special kind of AI-based software in that they interact in complex environments and have increased potential for emergent behaviour. Explaining such emergent behaviour is key to deploying trustworthy AI, but the increasing…