On knowledge games.

Lasry, J. M., Morel, J. M., and Solimini, S.. "On knowledge games.." Revista Matemática de la Universidad Complutense de Madrid 2.2-3 (1989): 187-201. <http://eudml.org/doc/43542>.

@article{Lasry1989,
abstract = {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.},
author = {Lasry, J. M., Morel, J. M., Solimini, S.},
journal = {Revista Matemática de la Universidad Complutense de Madrid},
keywords = {Teoría de juegos; Aprendizaje; decidability; convergence; knowledge game},
language = {eng},
number = {2-3},
pages = {187-201},
title = {On knowledge games.},
url = {http://eudml.org/doc/43542},
volume = {2},
year = {1989},
}

TY - JOUR
AU - Lasry, J. M.
AU - Morel, J. M.
AU - Solimini, S.
TI - On knowledge games.
JO - Revista Matemática de la Universidad Complutense de Madrid
PY - 1989
VL - 2
IS - 2-3
SP - 187
EP - 201
AB - 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.
LA - eng
KW - Teoría de juegos; Aprendizaje; decidability; convergence; knowledge game
UR - http://eudml.org/doc/43542
ER -