arXiv (All)
open access
Strategic Information Transmission over Gossip Networks
computer-science-and-game-theoryinformation-theorynetworking-and-internet-architecturesocial-and-information-networkssystems-and-control
We consider a fully connected gossip network of $n$ nodes that track a binary continuous-time Markov source through a strategic sender transmitting updates under a communication budget at a rate that depends on the source state. The receivers exchange packets through gossip and decide whether to fol
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Balancing Gossip Exchanges in Networks with Firewalls#168216
- Semantic Freshness Optimal Sampling and Transmission for Gossiping Receivers#819160
- Semantic Freshness Optimal Sampling and Transmission for Gossiping Receivers#809168
- Communicate and Vote: Collective Truth-tracking in Networks#723036
- Randomly Initialized Networks Can Learn from Peer-to-Peer Consensus#120532
Record · ID 997582
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive