We give a formalization of the ?knowledge games? which allows to study their decidability and convergence as a problem of mathematics. Our approach is based on a metalemma analogous to those of Von Neumann and Morgenstern at the beginning of Game Theory. We are led to definitions which characterize the knowledge games as objects is standard set theory. We then study rigorously the most classical knowledge games and, although we also prove that the ?common knowledge? in these games may be incomputable, show their decidability in a simple way.
@article{urn:eudml:doc:43542,
title = {On knowledge games.},
journal = {Revista Matem\'atica de la Universidad Complutense de Madrid},
volume = {2},
year = {1989},
pages = {187-201},
zbl = {0704.90103},
mrnumber = {MR1031694},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:43542}
}
Lasry, J. M.; Morel, J. M.; Solimini, S. On knowledge games.. Revista Matemática de la Universidad Complutense de Madrid, Tome 2 (1989) pp. 187-201. http://gdmltest.u-ga.fr/item/urn:eudml:doc:43542/