Realistic gossip in Trust Game on networks: the GODS model

• URL: http://arxiv.org/abs/2511.20248v1
• Date: Tue, 25 Nov 2025 12:23:05 GMT
• Title: Realistic gossip in Trust Game on networks: the GODS model
• Abstract summary: We develop an agent-based model that pairs realistic gossip processes with different variants of Trust Game.<n>Results show that cooperators suffer when local interactions govern spread of gossip, because they cannot discriminate against defectors.<n> Realistic gossiping increases the overall amount of resources, but is more likely to promote defection.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Gossip has been shown to be a relatively efficient solution to problems of cooperation in reputation-based systems of exchange, but many studies don't conceptualize gossiping in a realistic way, often assuming near-perfect information or broadcast-like dynamics of its spread. To solve this problem, we developed an agent-based model that pairs realistic gossip processes with different variants of Trust Game. The results show that cooperators suffer when local interactions govern spread of gossip, because they cannot discriminate against defectors. Realistic gossiping increases the overall amount of resources, but is more likely to promote defection. Moreover, even partner selection through dynamic networks can lead to high payoff inequalities among agent types. Cooperators face a choice between outcompeting defectors and overall growth. By blending direct and indirect reciprocity with reputations we show that gossiping increases the efficiency of cooperation by an order of magnitude.

Related papers

• Emergence of cooperation: A reputation-modulated reinforcement learning [19.357969561684982]
  Reputation is widely recognized as a key mechanism for sustaining cooperation.<n>We propose a spatial prisoner's dilemma game grounded in the reinforcement learning paradigm.<n>Our results reveal that reputation-modulated learning significantly promotes the emergence of cooperative behavior.
  arXiv  Detail & Related papers  (2026-08-20T13:27:41Z)
• Revisiting Gossip Protocols: A Vision for Emergent Coordination in Agentic Multi-Agent Systems [0.0]
  Gossip protocols offer a missing layer for context-rich, adaptive communication in agentic AI.<n>Gossip enables scalable, low-overhead dissemination of shared knowledge, but also raises unresolved challenges.<n>Gossip is not a silver bullet, but overlooking it risks missing a key path toward resilient, reflexive, and self-organizing multi-agent systems.
  arXiv  Detail & Related papers  (2025-08-03T01:18:58Z)
• Beyond the Tragedy of the Commons: Building A Reputation System for Generative Multi-agent Systems [14.839510542470734]
  RepuNet is a dual-level reputation framework that models both agent-level reputation dynamics and system-level network evolution.<n>We show that RepuNet effectively mitigates the 'tragedy of the commons', promoting and sustaining cooperation in generative MASs.
  arXiv  Detail & Related papers  (2025-05-08T08:02:20Z)
• Collaborative Value Function Estimation Under Model Mismatch: A Federated Temporal Difference Analysis [55.13545823385091]
  Federated reinforcement learning (FedRL) enables collaborative learning while preserving data privacy by preventing direct data exchange between agents.<n>In real-world applications, each agent may experience slightly different transition dynamics, leading to inherent model mismatches.<n>We show that even moderate levels of information sharing significantly mitigate environment-specific errors.
  arXiv  Detail & Related papers  (2025-03-21T18:06:28Z)
• Problem-Solving in Language Model Networks [44.99833362998488]
  This work extends the concept of multi-agent debate to more general network topologies. It measures the question-answering accuracy, influence, consensus, and the effects of bias on the collective.
  arXiv  Detail & Related papers  (2024-06-18T07:59:14Z)
• Incentivized Communication for Federated Bandits [67.4682056391551]
  We introduce an incentivized communication problem for federated bandits, where the server shall motivate clients to share data by providing incentives. We propose the first incentivized communication protocol, namely, Inc-FedUCB, that achieves near-optimal regret with provable communication and incentive cost guarantees.
  arXiv  Detail & Related papers  (2023-09-21T00:59:20Z)
• Interruption-Aware Cooperative Perception for V2X Communication-Aided Autonomous Driving [49.42873226593071]
  We propose V2X communication INterruption-aware COoperative Perception (V2X-INCOP) for V2X communication-aided autonomous driving. We use historical cooperation information to recover missing information due to the interruptions and alleviate the impact of the interruption issue. Experiments on three public cooperative perception datasets demonstrate that the proposed method is effective in alleviating the impacts of communication interruption on cooperative perception.
  arXiv  Detail & Related papers  (2023-04-24T04:59:13Z)
• Distributed Adaptive Learning Under Communication Constraints [54.22472738551687]
  This work examines adaptive distributed learning strategies designed to operate under communication constraints. We consider a network of agents that must solve an online optimization problem from continual observation of streaming data.
  arXiv  Detail & Related papers  (2021-12-03T19:23:48Z)
• Cooperation and Reputation Dynamics with Reinforcement Learning [6.219565750197311]
  We show how reputations can be used as a way to establish trust and cooperation. We propose two mechanisms to alleviate convergence to undesirable equilibria. We show how our results relate to the literature in Evolutionary Game Theory.
  arXiv  Detail & Related papers  (2021-02-15T12:48:56Z)
• Gaussian Process Based Message Filtering for Robust Multi-Agent Cooperation in the Presence of Adversarial Communication [5.161531917413708]
  We consider the problem of providing robustness to adversarial communication in multi-agent systems. We propose a communication architecture based on Graph Neural Networks (GNNs) We show that our filtering method is able to reduce the impact that non-cooperative agents cause.
  arXiv  Detail & Related papers  (2020-12-01T14:21:58Z)
• Learning to Communicate and Correct Pose Errors [75.03747122616605]
  We study the setting proposed in V2VNet, where nearby self-driving vehicles jointly perform object detection and motion forecasting in a cooperative manner. We propose a novel neural reasoning framework that learns to communicate, to estimate potential errors, and to reach a consensus about those errors.
  arXiv  Detail & Related papers  (2020-11-10T18:19:40Z)
• On Emergent Communication in Competitive Multi-Agent Teams [116.95067289206919]
  We investigate whether competition for performance from an external, similar agent team could act as a social influence. Our results show that an external competitive influence leads to improved accuracy and generalization, as well as faster emergence of communicative languages.
  arXiv  Detail & Related papers  (2020-03-04T01:14:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.