We study the probability that two or more agents can attain common knowledge of nontrivial events when the size of the state space grows large. We adopt the standard epistemic model where the knowledge of an agent is represented by a partition of the state space. Each agent is endowed with a...

Meier (2012) gave a "mathematical logic foundation" of the purely measurable universal type space (Heifetz and Samet, 1998). The mathematical logic foundation, however, discloses an inconsistency in the type space literature: a finitary language is used for the belief hierarchies and an...

Meier (2012) gave a "mathematical logic foundation" of the purely measurable universal type space (Heifetz and Samet, 1998). The mathematical logic foundation, however, discloses an inconsistency in the type space literature: a finitary language is used for the belief hierarchies and an...

We develop an approach to providing epistemic conditions for admissible behavior in games. Instead of using lexicographic beliefs to capture infinitely less likely conjectures, we postulate that players use tie-breaking sets to help decide among strategies that are outcome-equivalent given their...

This paper provides a definition of epistemic stability of sets of strategy profiles,and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.

The issue of the order-dependence of iterative deletion processes is well-known in the game theory community, and meanwhile conditions on the dominance concept underlying these processes have been detected which ensure order-independence (see e.g. the criteria of Gilboa et al., 1990 and Apt,...

One central issue tackled in epistemic game theory is whether for a general class of strategic games the solution generated by iterated application of a choice rule gives exactly the strategy profiles that might be realized by players who follow this choice rule and commonly believe they follow...

This paper provides two conditions of epistemic robustness, robustness to alternative best replies and robustness to non-best replies, and uses them to characterize variants of curb sets in finite games, including the set of rationalizable strategies.

The issue of the order-dependence of iterative deletion processes is well-known in the game theory community, and meanwhile conditions on the dominance concept underlying these processes have been detected which ensure order-independence (see e.g. the criteria of Gilboa et al., 1990 and Apt,...

This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.