The epistemic gossip problem
From MaRDI portal
Publication:1712508
DOI10.1016/j.disc.2018.10.041zbMath1486.68189OpenAlexW2902151307WikidataQ128872977 ScholiaQ128872977MaRDI QIDQ1712508
Faustine Maffre, Pierre Régnier, Frédéric Maris, Andreas Herzig, Martin C. Cooper
Publication date: 22 January 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://oatao.univ-toulouse.fr/22594/1/cooper_22594.pdf
Graph theory (including graph drawing) in computer science (68R10) Logics of knowledge and belief (including belief change) (03B42) Network protocols (68M12) Agent technology and artificial intelligence (68T42)
Related Items
Everyone knows that everyone knows ⋮ The logic of gossiping ⋮ Unnamed Item ⋮ A lightweight epistemic logic and its application to planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Epistemic protocols for dynamic gossip
- Further gossip problems
- New gossips and telephones
- The communication problem on graphs
- Hierarchical broadcast and gossip networks
- The partial gossiping problem
- Reordered gossip schemes
- A study of minimum gossip graphs
- Gossips and telephones
- Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
- MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY
- Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
- A survey of gossiping and broadcasting in communication networks
- A Problem with Telephones
- Gossiping in Minimal Time
- How to share knowledge by gossiping
- Some minimum gossip graphs
- A Cure for the Telephone Disease
- Algorithms - ESA 2003
