How to share knowledge by gossiping

DOI10.3233/AIC-170723MaRDI QIDQ4589265zbMATH OpenOpenAlexFDO

Authors Andreas Herzig, Faustine Maffre

Publication date 10 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-170723

zbMATH Keywords

common knowledgedynamic epistemic logicepistemic logicgossip protocolobservabilityshared knowledgetheory of mindvisibility

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• The epistemic gossip problem
• When Are Two Gossips the Same?
• The logic of gossiping
• scientific article; zbMATH DE number 6747860
• scientific article; zbMATH DE number 7440211

Cited in

(16)

• How to discreetly spread a rumor in a crowd
• Will any gossip do? Gossip does not need to be perfectly accurate to promote trust
• The epistemic gossip problem
• Propositional gossip protocols
• The logic of gossiping
• Minimal number of calls in propositional protocols
• On decidability of a logic of gossips
• Possible worlds semantics based on observation and communication
• The pleasure of gossip
• Dynamic epistemic logics: promises, problems, shortcomings, and perspectives
• Common knowledge in a logic of gossips
• Open problems in a logic of gossips
• When Are Two Gossips the Same?
• scientific article; zbMATH DE number 6747860 (Why is no real title available?)
• The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable
• You can only be lucky once: optimal gossip for epistemic goals

This page was built for publication: How to share knowledge by gossiping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589265)