Epistemic Boolean Games Based on a Logic of Visibility and Control

Authors: Andreas Herzig, Emiliano Lorini, Faustine Maffre, Francois Schwarzentruber

IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We analyse epistemic boolean games in a computationally grounded dynamic epistemic logic. The agents knowledge is determined by what they see, including higher-order visibility: agents may observe whether another agent observes an atom or not. The agents actions consist in modifying the truth values of atoms. We provide an axiomatisation of the logic, establish that the model checking problem is in PSPACE, and show how one can reason about equilibria in epistemic boolean games.
Researcher Affiliation Academia 1IRIT, University of Toulouse, France 2IRISA, ENS Rennes, France
Pseudocode No The paper defines language syntax and provides symbolic expressions for programs (e.g., 'vary If Not Seen(i, )'), but it does not include structured pseudocode blocks or algorithms with numbered steps.
Open Source Code No The paper does not contain any statements about providing open-source code or links to a code repository.
Open Datasets No This is a theoretical paper focusing on logic, axiomatization, and complexity. It does not involve empirical training on datasets.
Dataset Splits No This is a theoretical paper and does not involve empirical validation on datasets, such as using validation splits or cross-validation.
Hardware Specification No As a theoretical paper, no hardware specifications for running experiments are mentioned.
Software Dependencies No The paper does not list specific software dependencies with version numbers needed to replicate any practical aspects, as it is a theoretical work.
Experiment Setup No As a theoretical paper, there are no details on an experimental setup, such as hyperparameters or system-level training settings.