Exploring the tractability border in epistemic tasks

• Autores: Cédric Dégremont, Lena Kurzen, Jakub Szymanik
• Localización: Synthese, ISSN-e 1573-0964, Vol. 191, Nº. 3, 2014, págs. 371-408
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We analyse the computational complexity of comparing informational structures. Intuitively, we study the complexity of deciding queries such as the following: Is Alice's epistemic information strictly coarser than Bob's? Do Alice and Bob have the same knowledge about each other's knowledge? Is it possible to manipulate Alice in a way that she will have the same beliefs as Bob? The results show that these problems lie on both sides of the border between tractability (P) and intractability (NP-hard). In particular, we investigate the impact of assuming information structures to be partition-based (rather than arbitrary relational structures) on the complexity of various problems. We focus on the tractability of concrete epistemic tasks and not on epistemic logics describing them