Abstract
A partitional model of knowledge is monotonic if there exists a linear order on the state space such that, for every player, each element of her partition contains only a sequence of consecutive states. In monotonic models, the absence of alternating cycles is equivalent to the property that, for every pair of players, the join of their partitions contains only singletons. Under these equivalent conditions any set of posteriors for the players is consistent (i.e., there is a common prior). When checking for consistency in a monotonic model, it is not necessary to evaluate all cycle equations; if the cycle equations corresponding to cycles of length two hold, then there is a common prior.
Original language | English |
---|---|
Pages (from-to) | 403-413 |
Number of pages | 11 |
Journal | International Journal of Game Theory |
Volume | 43 |
Issue number | 2 |
DOIs | |
Publication status | Published - May 2014 |