Role of feedback and broadcasting in the naming game

The naming game (NG) describes the agreement dynamics of a population of agents that interact locally in a pairwise fashion, and in recent years statistical physics tools and techniques have greatly contributed to shed light on its rich phenomenology. Here we investigate in details the role played by the way in which the two agents update their states after an interaction. We show that slightly modifying the NG rules in terms of which agent performs the update in given circumstances (i.e. after a success) can either alter dramatically the overall dynamics or leave it qualitatively unchanged. We understand analytically the first case by casting the model in the broader framework of a generalized NG. As for the second case, on the other hand, we note that the modified rule reproducing the main features of the usual NG corresponds in fact to a simplification of it consisting in the elimination of feedback between the agents. This allows us to introduce and study a very natural broadcasting scheme on networks that can be potentially relevant for different applications, such as the design and implementation of autonomous sensor networks, as pointed out in the recent literature.

💡 Research Summary

The paper revisits the classic Naming Game (NG), a minimal model of how a population of agents reaches consensus through pairwise interactions, and focuses on the subtle yet crucial role of feedback during successful exchanges. In the standard NG, when two agents communicate successfully, both update their inventories to retain only the shared word. The authors systematically modify this rule by specifying which agent updates after a success, thereby generating three distinct variants. The first variant lets only the speaker prune its inventory while the listener remains unchanged. Simulations on various network topologies reveal dramatically longer convergence times, higher memory loads, and in many cases a failure to converge at all. To explain this, the authors embed the NG into a broader “Generalized Naming Game” framework, derive transition matrices, and apply mean‑field approximations to locate critical points. Their analysis shows that restricting updates to a single side hampers the competitive elimination of synonyms, leading to metastable states with persistent lexical diversity.
The second variant, in which only the listener updates, reproduces the qualitative and quantitative behavior of the original NG. This outcome is interpreted as a “feedback elimination” scenario: the speaker’s state remains untouched, while the listener simply adopts the communicated word. Remarkably, the removal of explicit two‑way feedback does not degrade the system’s ability to reach consensus, suggesting that the essential ingredient is the unidirectional transmission of information rather than mutual adjustment.
Building on this insight, the authors propose a natural broadcasting scheme. Instead of a dyadic exchange, a single agent simultaneously broadcasts a word to all its neighbors; each neighbor either adds the word to its inventory or replaces an existing entry. Extensive numerical experiments on Erdős‑Rényi, scale‑free, and small‑world networks demonstrate that broadcasting accelerates convergence (by roughly 30–50 % compared with the standard NG) and reduces the average inventory size per agent (by about 20 %). The improvement is especially pronounced in highly heterogeneous networks where hub nodes can disseminate the consensus word rapidly.
The paper concludes that (i) the precise allocation of feedback after successful interactions can either destabilize the dynamics or leave it essentially unchanged, (ii) a simplified NG without mutual feedback retains the core phenomenology of the original model, and (iii) the broadcasting extension offers a scalable, energy‑efficient mechanism for achieving agreement in distributed systems such as autonomous sensor networks, IoT deployments, or swarms of robots. By linking microscopic rule variations to macroscopic outcomes, the study provides valuable guidance for both theoretical investigations of language emergence and practical design of consensus protocols in engineered networks.