=Paper=
{{Paper
|id=Vol-1811/inv1
|storemode=property
|title=None
|pdfUrl=https://ceur-ws.org/Vol-1811/inv1.pdf
|volume=Vol-1811
|dblpUrl=https://dblp.org/rec/conf/clar/Ditmarsch16
}}
==None==
<pdf width="1500px">https://ceur-ws.org/Vol-1811/inv1.pdf</pdf>
<pre>
                                 Epistemic Gossip Protocols

                                                 Hans van Ditmarsch
                                   LORIA / CNRS - University of Lorraine, Nancy
                                 Institute of Mathematical Sciences (IMSc), Chennai




                                                        Abstract
                       A well-studied phenomenon in network theory since the 1970s are opti-
                       mal schedules to distribute information by one-to-one communication
                       between nodes. One can take these communicative actions to be tele-
                       phone calls, and protocols to spread information this way are known as
                       gossip protocols or epidemic protocols. Statistical approaches to gossip
                       have taken a large fight since then, witness for example the survey “Epi-
                       demic Information Dissemination in Distributed Systems” by Eugster
                       et al. (IEEE Computer, 2004). It is typical to assume a global sched-
                       uler who executes a possibly non-deterministic or randomized protocol.
                       A departure from this methodology is to investigate epistemic gossip
                       protocols, where an agent (node) will call another agent not because
                       it is so instructed by a scheduler, but based on its knowledge or ig-
                       norance of the distribution of secrets over the network and of other
                       agents’ knowledge or ignorance of that. Such protocols are distributed
                       and do not need a central scheduler. This comes at a cost: they may
                       take longer to terminate than non-epistemic, globally scheduled, pro-
                       tocols. A number of works have appeared over the past years (Apt et
                       al., Attamah et al., van Ditmarsch et al., van Eijck & Gatting, Herzig
                       & Maffre) of which we present a survey, including open problems yet
                       to be solved by the community.




Copyright © by the paper’s authors. Copying permitted for private and academic purposes.
In: T. Ågotnes, B. Liao, Y.N. Wang (eds.): Proceedings of the first Chinese Conference on Logic and Argumentation (CLAR 2016),
Hangzhou, China, 2-3 April 2016, published at http://ceur-ws.org




                                                            1

</pre>