Exploring the tractability border in epistemic tasks.

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

Descripción completa

Detalles Bibliográficos

Publicado en:	Synthese Vol. 191; no. 3; pp. 371 - 409
Autores principales:	Dégremont, Cédric, Kurzen, Lena, Szymanik, Jakub
Formato:	Artículo
Publicado:	Springer Nature Feb2014
Materias:	Epistemic logic Computational complexity Decision making Comparative studies Multiagent systems
Acceso en línea:	Ver este registro en EBSCOhost