We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We consider five generalizations of convexity in the NTU...

Meier [Games Econ. Behav. 62, 53–66] shows that the universal knowledge–belief space exists. However, besides the universality there is an other important property might be imposed on knowledge–belief spaces, inherited also from type spaces, the completeness. In this paper, we introduce...

Several game theoretical topics require the analysis of hierarchical beliefs, particularly in incomplete information situations. For the problem of incomplete information, Harsányi suggested the concept of the type space. Later Mertens and Zamir gave a construction of such a type space under...