Author:
Attamah Maduka,van Ditmarsch Hans,Grossi Davide,van der Hoek Wiebe
Publisher
Springer International Publishing
Reference18 articles.
1. Ågotnes, T., & van Ditmarsch, H. (2011). What will they say?—Public announcement games. Synthese, 179(S.1), 57–85.
2. Attamah, M., van Ditmarsch, H., Grossi, D., & van der Hoek, W. (2014). Knowledge and gossip. In Proceedings of the 21st ECAI (pp. 21–26). IOS Press.
3. Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006). Randomized gossip algorithms. IEEE/ACM Transactions on Networks, 14(SI), 2508–2530.
4. Chopra, S., Pacuit, E., & Parikh, R. (2004). Knowledge-theoretic properties of strategic voting. In Proceedings of the 9th JELIA, LNCS 3229 (pp. 18–30).
5. Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. Y. (1995). Reasoning about knowledge. Cambridge, MA: MIT Press.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. You can only be lucky once: optimal gossip for epistemic goals;Mathematical Structures in Computer Science;2024-04-19
2. Everyone Knows That Everyone Knows: Gossip Protocols for Super Experts;Studia Logica;2023-01-30
3. The logic of secrets and the interpolation rule;Annals of Mathematics and Artificial Intelligence;2022-10-10
4. Reachability of Five Gossip Protocols;Lecture Notes in Computer Science;2019
5. Dynamic Gossip;Bulletin of the Iranian Mathematical Society;2018-09-06