We show that the characterization result of the weak core correspondence in simple games in Takamiya et al. (2018) still holds true even when the set of alternatives contains uncountably infinite elements

Top responsiveness is introduced by Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] as a property which induces a rich domain on players's preferences in hedonic games, and guarantees the existence of core stable partitions. We strengthen this observation by proving the...

We provide a new proof of the non-emptiness of approximate cores of games with many players of a finite number of types. Earlier papers in the literature proceed by showing that, for games with many players, equal-treatment cores of their "balanced cover games", which are non-empty, can be...

A new feature pertaining to proposer's ability to implement offers is introduced in the extensive form bargaining mechanism studied in Chatterjee et. al. (1993). This mechanism is used to analyze two classes of coalitional games with transferable utility. One class is that of strictly...

This chapter surveys a sizable and growing literature on coalition formation. We refer to theories in which one or more groups of agents (“coalitions”) deliberately get together to jointly determine within-group actions, while interacting noncooperatively across groups. The chapter describes...

In discrete exchange economies with possibly redundant and joint ownership, we propose new core notions in the conventional flavor by regarding endowments as rights to consume or trade with others. Our key idea is to identify self-enforcing coalitions and to redistribute their redundant property...

We study coalition formation problems with general externalities. We prove that if expectations are not prudent a stable coalitions structure can fail to exist. Under prudent expectations a stable coalition structure exists if the set of admissible coalitions is single-lapping. This assumption...

It is known that on some social choice and economic domains, a social choice function is coalition strategy-proof if and only if it is Maskin monotonic (e.g. Muller and Satterthwaite, 1977). This paper studies the foundation of those results. I provide a set of conditions which is sufficient for...

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

Power indices have been used to evaluate the allocation of power in a wide range of voting situations. While they use the language of game theory known measures of a priori voting power are hardly more than statistical expectations assuming the random behaviour of the players. We introduce a...