Dealing with Unreliable Agents in Dynamic Gossip
| Autor: | van den Berg, Line, Gattinger, Malvin, Martins, Manuel A., Sedlár, Igor |
|---|---|
| Přispěvatelé: | Evolution de la connaissance (MOEX ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), University of Groningen [Groningen], Manuel Martins, Igor Sedlár, Artificial Intelligence |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
TheoryofComputation_MISCELLANEOUS
Computer science Semantics (computer science) Multi-agent system Multi-agent systems 020207 software engineering 02 engineering and technology Computer security computer.software_genre Semantics [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] Gossip Phone 0202 electrical engineering electronic engineering information engineering Gossip protocols 020201 artificial intelligence & image processing Gossip protocol computer |
| Zdroj: | Proc. 3rd International workshop on dynamic logic (DaLi) DaLi 2020-3rd International workshop on dynamic logic DaLi 2020-3rd International workshop on dynamic logic, Oct 2020, Praha, Czech Republic. pp.51-67, ⟨10.1007/978-3-030-65840-3_4⟩ Lecture Notes in Computer Science ISBN: 9783030658397 DaLí Dynamic Logic. New Trends and Applications: Third International Workshop, DaLí 2020, Prague, Czech Republic, October 9–10, 2020, Revised Selected Papers, 51-67 STARTPAGE=51;ENDPAGE=67;TITLE=Dynamic Logic. New Trends and Applications |
| DOI: | 10.1007/978-3-030-65840-3_4⟩ |
| Popis: | International audience; Gossip describes the spread of information throughout a network of agents. It investigates how agents, each starting with a unique secret, can efficiently make peer-to-peer calls so that ultimately everyone knows all secrets. In Dynamic Gossip, agents share phone numbers in addition to secrets, which allows the network to grow at run-time. Most gossip protocols assume that all agents are reliable, but this is not given for many practical applications. We drop this assumption and study Dynamic Gossip with unreliable agents. The aim is then for agents to learn all secrets of the reliable agents and to identify the unreliable agents. We show that with unreliable agents classic results on Dynamic Gossip no longer hold. Specifically, the Learn New Secrets protocol is no longer characterised by the same class of graphs, so-called sun graphs. In addition, we show that unreliable agents that do not initiate communication are harder to identify than agents that do. This has paradoxical consequences for measures against unreliability, for example to combat the spread of fake news in social networks. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|