arXiv subjects

Nima Motamed

Publications and source records attributed to Nima Motamed.

3 recordsLinked to original sources

arXiv2026

Coalgebraic analysis of social systems

The algebraic analysis of social systems, or algebraic social network analysis, refers to a collection of methods designed to extract information about the structure of a social system represented as a directed graph. Central among these are methods to determine the roles that exist within a given system, and the positions. The analysis of roles and positions is highly developed for social systems that involve only pairwise interactions among actors - however, in contemporary social network analysis it is increasingly common to use models that can take into account higher-order interactions as well. In this paper we take a category-theoretic approach to the question of how to lift role and positional analysis from graphs to hypergraphs, which can accommodate higher-order interactions. We use the framework of universal coalgebra - a 'theory of systems' with origins in computer science and logic - to formalize the main concepts of role and positional analysis and extend them to a large class of structures that includes both graphs and hypergraphs. As evidence for the validity of our definitions, we prove a very general functoriality theorem that specializes, in the case of graphs, to a folkloric observation about the compatibility of positional and role analysis.

cs.SI↗

arXiv2025

Changing the Rules of the Game: Reasoning about Dynamic Phenomena in Multi-Agent Systems

The design and application of multi-agent systems (MAS) require reasoning about the effects of modifications on their underlying structure. In particular, such changes may impact the satisfaction of system specifications and the strategic abilities of their autonomous components. In this paper, we are concerned with the problem of verifying and synthesising modifications (or updates) of MAS. We propose an extension of the Alternating-Time Temporal Logic ($\mathsf{ATL}$) that enables reasoning about the dynamics of model change, called the Logic for $\mathsf{ATL}$ Model Building ($\mathsf{LAMB}$). We show how $\mathsf{LAMB}$ can express various intuitions and ideas about the dynamics of MAS, from normative updates to mechanism design. As the main technical result, we prove that, while being strictly more expressive than $\mathsf{ATL}$, $\mathsf{LAMB}$ enjoys a P-complete model-checking procedure.

cs.LO↗

arXiv2024

Probabilistic Strategy Logic with Degrees of Observability

There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are unable to express properties relating to information transparency. Information transparency concerns the extent to which agents' actions and behaviours are observable by other agents. Reasoning about information transparency is useful in many domains including security, privacy, and decision-making. In this paper, we present a formal framework for reasoning about information transparency properties in stochastic multi-agent systems. We extend Probabilistic Strategy Logic with new observability operators that capture the degree of observability of temporal properties by agents. We show that the model checking problem for the resulting logic is decidable.

cs.AI↗