This paper first establishes a new core theorem using the concept of generated payoffs: the TU (transferable utility) core is empty if and only if the maximum of generated payoffs (mgp) is greater than the grand coalition’s payoff v(N), or if and only if it is irrational to split v(N). It then...

A coalitional matching is a two-sided matching problem in which agents on each side of the market may form coalitions such as student groups and research teams who - when matched - form universities. We assume that each researcher has preferences over the research teams he would like to work in...

This paper investigates the suitability of apportionment methods based on the idea of preserving the coalition function of the simple game represented by the populations of the states. The results show that an apportionment method which satisfies desirable properties such as population...

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...

We are concerned with the problem of core membership testing for hedonic coalition formation games, which is to decide whether a certain coalition structure belongs to the core of a given game. We show that this problem is co-NP complete when players' preferences are additive. -- Additivity ;...