Related papers: A communication protocol based on NK boolean netwo…

This paper introduces a lightweight and auditable method for asynchronous information exchange between distributed entities using Git as the coordination medium. The proposed approach replaces traditional APIs and message brokers with a…

We introduce new models and new information theoretic measures for the study of communication complexity in the natural peer-to-peer, multi-party, number-in-hand setting. We prove a number of properties of our new models and measures, and…

We consider the scenario of $n$ sensor nodes observing streams of data. The nodes are connected to a central server whose task it is to compute some function over all data items observed by the nodes. In our case, there exists a total order…

Mechanisms such as auctions and pricing schemes are utilized to design strategic (noncooperative) games for networked systems. Although the participating players are selfish, these mechanisms ensure that the game outcome is optimal with…

We present an example where a distributed coordinated protocol supported by a blockchain-enabled monetary mechanism leads to achieving optimal information theoretic degrees of freedom gains. The considered setting is that of a linear…

The dynamics of Boolean networks (the N-K model) with scale-free topology are studied here. The existence of a phase transition governed by the value of the scale-free exponent of the network is shown analytically by analyzing the overlap…

The quantum internet holds promise for performing quantum communication, such as quantum teleportation and quantum key distribution (QKD), freely between any parties all over the globe. Such a future quantum network, depending on the…

Ad-hoc networks are independent of any infrastructure. The nodes are autonomous and make their own decisions. They also have limited energy resources. Thus, a node tends to behave selfishly when it is asked to forward the packets of other…

Many real-world applications give rise to large heterogeneous networks where nodes and edges can be of any arbitrary type (e.g., user, web page, location). Special cases of such heterogeneous graphs include homogeneous graphs, bipartite,…

Modern AI agents can exchange messages using protocols such as A2A and ACP, yet these mechanisms emphasize communication over coordination. As agent populations grow, this limitation produces brittle collective behavior, where individually…

In numerous artificial intelligence applications, the collaborative efforts of multiple intelligent agents are imperative for the successful attainment of target objectives. To enhance coordination among these agents, a distributed…

This paper studies group target trajectory intent as the outcome of a cooperative game where the complex-spatio trajectories are modeled using an NLP-based generative model. In our framework, the group intent is specified by the…

In this paper, we study cooperation in distributed games under network-constrained communication. Building on the framework of Monderer and Tennenholtz (1999), we derive a sufficient condition for cooperative equilibrium in settings where…

The emergence of new communication technologies allows us to expand our understanding of distributed control and consider collaborative decision-making paradigms. With collaborative algorithms, certain local decision-making entities (or…

Existing neural models for dialogue response generation assume that utterances are sequentially organized. However, many real-world dialogues involve multiple interlocutors (i.e., multi-party dialogues), where the assumption does not hold…

Multi-agent debate has proven effective in improving large language models quality for reasoning and factuality tasks. While various role-playing strategies in multi-agent debates have been explored, in terms of the communication among…

Variations of the Flip-It game have been applied to model network cyber operations. While Flip-It can accurately express uncertainty and loss of control, it imposes no essential resource constraints for operations. Capture the flag (CTF)…

This article presents a new technique for suboptimal consensus protocol design for a class of multiagent systems. The technique is based upon the extension of newly developed sufficient conditions for suboptimal linear-quadratic optimal…

We investigate response selection for multi-turn conversation in retrieval-based chatbots. Existing studies pay more attention to the matching between utterances and responses by calculating the matching score based on learned features,…

Semantic communications will play a critical role in enabling goal-oriented services over next-generation wireless systems. However, most prior art in this domain is restricted to specific applications (e.g., text or image), and it does not…