no code implementations • 8 Feb 2022 • Hans van Ditmarsch, Sunil Simon
An outcome relation between such sets determines what the Nash equilibria are.
no code implementations • 4 Mar 2021 • Hans van Ditmarsch
We propose a logic of knowledge for impure simplicial complexes.
Distributed Computing Distributed, Parallel, and Cluster Computing Logic in Computer Science
no code implementations • 26 Nov 2020 • Hans van Ditmarsch, Malvin Gattinger, Rahim Ramezanian
Additionally, we model that agents who are super experts do not make and do not answer calls, and that this is common knowledge.
no code implementations • 13 Apr 2020 • Hans van Ditmarsch
In this survey we review dynamic epistemic logics with modalities for quantification over information change.
no code implementations • 27 Jul 2017 • Francesco Belardinelli, Hans van Ditmarsch, Wiebe van der Hoek
In this paper we introduce {\em global and local announcement logic} (GLAL), a dynamic epistemic logic with two distinct announcement operators -- $[\phi]^+_A$ and $[\phi]^-_A$ indexed to a subset $A$ of the set $Ag$ of all agents -- for global and local announcements respectively.
no code implementations • 27 Jul 2017 • Hans van Ditmarsch, Michael Ian Hartley, Barteld Kooi, Jonathan Welton, Joseph B. W. Yeo
We present four logic puzzles and after that their solutions.
no code implementations • 8 May 2017 • Philippe Balbiani, Hans van Ditmarsch, Saúl Fernández González
We propose a multi-agent epistemic logic of asynchronous announcements, where truthful announcements are publicly sent but individually received by agents, and in the order in which they were sent.
no code implementations • 27 Jun 2016 • Thomas Ågotnes, Hans van Ditmarsch, Yanjing Wang
A true lie is a lie that becomes true when announced.
2 code implementations • 3 Nov 2015 • Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian, François Schwarzentruber
We define six such distributed dynamic gossip protocols, and we characterize them in terms of the topology of the graphs on which they are successful, wherein we distinguish strong success (the protocol always terminates, possibly assuming fair scheduling) from weak success (the protocol sometimes terminates).
Discrete Mathematics
no code implementations • 26 Jun 2015 • Mikkel Birkegaard Andersen, Thomas Bolander, Hans van Ditmarsch, Martin Holm Jensen
We define that notion of bisimulation and prove the required characterisations: on the class of image-finite and preimage-finite models (with respect to the plausibility relation), two pointed Kripke models are modally equivalent in either of the three logics, if and only if they are bisimilar.
no code implementations • 3 Mar 2015 • Hans van Ditmarsch, Joseph Y. Halpern, Wiebe van der Hoek, Barteld Kooi
This chapter provides an introduction to some basic concepts of epistemic logic, basic formal languages, their semantics, and proof systems.
no code implementations • 30 Nov 2013 • Jie Fan, Yanjing Wang, Hans van Ditmarsch
In this paper, we study logics with a modal operator Kw for knowing whether but without a modal operator K for knowing that.
no code implementations • 16 Feb 2012 • Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat
In this paper we present {\em refinement modal logic}.