Epistemic protocols for dynamic gossip
| Autor: | François Schwarzentruber, Rahim Ramezanian, Pere Pardo, Jan van Eijck, Hans van Ditmarsch |
|---|---|
| Přispěvatelé: | ILLC (FNWI), Logic and Computation (ILLC, FNWI/FGw) |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
Logic Computer science Applied Mathematics ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 0102 computer and information sciences 02 engineering and technology 01 natural sciences ComputingMethodologies_ARTIFICIALINTELLIGENCE Graph Epistemology Epistemic modal logic 010201 computation theory & mathematics Gossip Telephone number 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Gossip protocol |
| Zdroj: | Journal of Applied Logic, 20, 1-31. Elsevier Journal of Applied Logic, 20, 1-31 |
| ISSN: | 1570-8683 |
| Popis: | A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. In each call between a pair of connected agents, the two agents share all the secrets they have learnt. In dynamic gossip problems, dynamic connection graphs are enabled by permitting agents to spread as well the telephone numbers of other agents they know. This paper characterizes different distributed epistemic protocols in terms of the (largest) class of graphs where each protocol is successful, i.e. where the protocol necessarily ends up with all agents knowing all secrets. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect