Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://hdl.handle.net/11701/33706
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorTohmé, Fernando-
dc.contributor.authorCaterina, Gianluca-
dc.contributor.authorGangle, Rocco-
dc.date.accessioned2021-11-29T20:55:49Z-
dc.date.available2021-11-29T20:55:49Z-
dc.date.issued2021-10-
dc.identifier.citationTohmé F., Caterina G., Gangle R. A Categorical Characterization of a ①-Iteratively De ned State of Common Knowledge. Contributions to Game Theory and Management, XIV, 329-341.en_GB
dc.identifier.otherhttps://doi.org/10.21638/11701/spbu31.2021.24-
dc.identifier.urihttp://hdl.handle.net/11701/33706-
dc.description.abstractWe present here a novel approach to the analysis of common knowledge based on category theory. In particular, we model the global epistemic state for a given set of agents through a hierarchy of beliefs represented by a presheaf construction. Then, by employing the properties of a categorical monad, we prove the existence of a state, obtained in an iterative fashion, in which all agents acquire common knowledge of some underlying statement. In order to guarantee the existence of a fixed point under certain suitable conditions, we make use of the properties entailed by Sergeyev's numeral system called grossone, which allows a finer control on the relevant structure of the infinitely nested epistemic states.en_GB
dc.description.sponsorshiphttps://doi.org/10.21638/11701/spbu31.2021.24en_GB
dc.language.isoenen_GB
dc.publisherSt Petersburg State Universityen_GB
dc.relation.ispartofseriesContributions to Game Theory and Management;Volume 14-
dc.subjectcommon knowledgeen_GB
dc.subjectcategory theoryen_GB
dc.subjectgrossoneen_GB
dc.titleA Categorical Characterization of a ①-Iteratively De ned State of Common Knowledgeen_GB
dc.typeArticleen_GB
Располагается в коллекциях:2021

Файлы этого ресурса:
Файл Описание РазмерФормат 
329-341.pdf549,62 kBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.