Skip to main content

The Pleasure of Gossip

  • Chapter
  • First Online:
Rohit Parikh on Logic, Language and Society

Part of the book series: Outstanding Contributions to Logic ((OCTR,volume 11))

Abstract

Rohit Parikh has written on levels of knowledge (Parikh and Krasucki in Sadhana 17(1):167–191, 1992). Levels of knowledge are relevant for the analysis of gossip protocols. Gossip protocols describe the dissemination of information over a network. We present some examples of epistemic gossip protocols, wherein the agents or processes communicate with each other by peer-to-peer contact (telephone calls), as in the usal gossip protocols, but wherein the decision to contact another agent is based on the calling agent’s information only. This is, as far as we know, unusual in gossip protocols. In this we wish to honour Rohikh Parikh’s long career and many contributions to logic and computer science.

We thank a reviewer for insightful comments. Hans is also affiliated to IMSc, Chennai, as research associate, and he acknowledges support from ERC project EPS 313360.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We will later define a restricted logical language which justifies to use only that succinct representation, there is no need for the more complex representation.

  2. 2.

    In other words, the meaning is the set of pointed gossip model sequences, where the points are the actual gossip states. Note that this is different from a set of gossip state sequences. Different pointed gossip model sequences may have the same induced gossip state sequence; i.e., if you just look at their points, they are the same.

References

  • Ågotnes, T., & van Ditmarsch, H. (2011). What will they say?—Public announcement games. Synthese, 179(S.1), 57–85.

    Google Scholar 

  • 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.

    Google Scholar 

  • Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006). Randomized gossip algorithms. IEEE/ACM Transactions on Networks, 14(SI), 2508–2530.

    Google Scholar 

  • Chopra, S., Pacuit, E., & Parikh, R. (2004). Knowledge-theoretic properties of strategic voting. In Proceedings of the 9th JELIA, LNCS 3229 (pp. 18–30).

    Google Scholar 

  • Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. Y. (1995). Reasoning about knowledge. Cambridge, MA: MIT Press.

    Google Scholar 

  • Hedetniemi, S. M., Hedetniemi, S. T., & Liestman, A. L. (1988). A survey of gossiping and broadcasting in communication networks. Networks, 18, 319–349.

    Article  Google Scholar 

  • Hurkens, C. A. J. (2000). Spreading gossip efficiently. Nieuw Archief voor Wiskunde, 5/1(2), 208–210.

    Google Scholar 

  • Jamroga, W., & van der Hoek, W. (2004). Agents that know how to play. Fundamenta Informaticae, 63, 185–219.

    Google Scholar 

  • Kempe, D., Dobra, A., & Gehrke, J. (2003). Gossip-based computation of aggregate information. In Proceedings of the 44th FOCS (pp. 482–491). IEEE Computer Society.

    Google Scholar 

  • Knödel, W. (1975). New gossips and telephones. Discrete Mathematics, 13, 95.

    Google Scholar 

  • Parikh, R., & Krasucki, P. (1992). Levels of knowledge in distributed systems. Sadhana, 17(1), 167–191.

    Article  Google Scholar 

  • Parikh, R., & Ramanujam, R. (1985). Distributed processing and the logic of knowledge. In Logic of programs, LNCS 193 (pp. 256–268). Berlin: Springer. Similar to JoLLI 12, 453–467, 2003.

    Google Scholar 

  • Parikh, R., & Ramanujam, R. (2003). A knowledge based semantics of messages. Journal of Logic, Language and Information, 12, 453–467.

    Article  Google Scholar 

  • Parikh, R., Tasdemir, C., & Witzel, A. (2013). The power of knowledge in games. IGTR, 15(4).

    Google Scholar 

  • Sietsma, F. (2012). Logics of communication and knowledge. PhD thesis, University of Amsterdam. ILLC Dissertation Series DS-2012-11.

    Google Scholar 

  • Tijdeman, R. (1971). On a telephone problem. Nieuw Archief voor Wiskunde, 3(19), 188–192.

    Google Scholar 

  • van Benthem, J. (2001). Games in dynamic epistemic logic. Bulletin of Economic Research, 53(4), 219–248.

    Article  Google Scholar 

  • van Ditmarsch, H. (2000). Knowledge games. PhD thesis, University of Groningen. ILLC Dissertation Series DS-2000-06.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hans van Ditmarsch .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Attamah, M., van Ditmarsch, H., Grossi, D., van der Hoek, W. (2017). The Pleasure of Gossip. In: Başkent, C., Moss, L., Ramanujam, R. (eds) Rohit Parikh on Logic, Language and Society. Outstanding Contributions to Logic, vol 11. Springer, Cham. https://doi.org/10.1007/978-3-319-47843-2_9

Download citation

Publish with us

Policies and ethics