Related papers: Semitopology: distributed collaborative action via…
Physical social encounters are governed by a set of socio-psychological behavioral rules with a high degree of uniform validity. Past research has shown how these rules or the resulting properties of the encounters (e.g. the geometry of…
In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the…
Contact Boolean algebras are one of the main algebraic tools in region-based theory of space. T. Ivanova provided strong motivations for the study of merely semilattices with a contact relation. Another significant motivation for…
This paper is concerned with the problem of controlling a system of constrained dynamic subsystems in a way that balances the performance degradation of decentralized control with the practical cost of centralized control. We propose a…
A growing body of empirical evidence indicates that social and cooperative behavior can be affected by cognitive and neurological factors, suggesting the existence of state-based decision-making mechanisms that may have emerged by…
The emergence of collective dynamics in neural networks is a mechanism of the animal and human brain for information processing. In this paper, we develop a computational technique using distributed processing elements in a complex network,…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
Modern artificial intelligence relies on networks of agents that collect data, process information, and exchange it with neighbors to collaboratively solve optimization and learning problems. This article introduces a novel distributed…
Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient faults. In this paper, we propose a self-stabilizing reset…
We investigate continuous transitive actions of semitopological groups on spaces, as well as separately continuous transitive actions of topological groups.
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
Research in cooperative games often assumes that agents know the coalitional values with certainty, and that they can belong to one coalition only. By contrast, this work assumes that the value of a coalition is based on an underlying…
We define and develop the notion of a discretisable quasi-action. It is shown that a cobounded quasi-action on a proper non-elementary hyperbolic space $X$ not fixing a point of $\partial X$ is quasi-conjugate to an isometric action on…
Modeling distributed computing in a way enabling the use of formal methods is a challenge that has been approached from different angles, among which two techniques emerged at the turn of the century: protocol complexes, and directed…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…
The existence of a coalition strategy to achieve a goal does not necessarily mean that the coalition has enough information to know how to follow the strategy. Neither does it mean that the coalition knows that such a strategy exists. The…
We study the self-assembly of a complex network of collaborations among self-interested agents. The agents can maintain different levels of cooperation with different partners. Further, they continuously, selectively, and independently…
There has been substantial work studying consensus problems for which there is a single common final state, although there are many real-world complex networks for which the complete consensus may be undesirable. More recently, the concept…
Distributed averaging is among the most relevant cooperative control problems, with applications in sensor and robotic networks, distributed signal processing, data fusion, and load balancing. Consensus and gossip algorithms have been…