In this paper we establish a relationship between the core cover of a compromise admissible game and the core of a particular bankruptcy game: the core cover of a compromise admissible game is, indeed, a translation of the set of coalitional stable allocations captured by an associated...

We analyze cooperative Cournot games with boundedly rational firms. Due to cognitive constraints, the members of a coalition cannot accurately predict the coalitional structure of the non-members. Thus, they compute their value following simple heuristics. In particular, they assign various...

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 paper analyzes bankruptcy games with nontransferable utility as a generalization of bankruptcy games with monetary payoffs. Following the game theoretic approach to NTU-bankruptcy problems, we study some appropriate properties and the core of NTU-bankruptcy games. Generalizing the core...

A situation in which a finite set of agents can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility (or simply a TU-game) where each agent is represented by one player in the game. In this paper, we assume that one agent can be represented by...

We consider a multi-sided assignment game with the following characteristics: (a) the agents are organized in m sectors that are connected by a graph that induces a weighted m-partite graph on the set of agents, (b) a basic coalition is formed by agents from different connected sectors, and (c)...

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...

This paper contributes to the program of numerical characterisation and classification of simple games outlined in the classical monograph of von Neumann and Morgenstern (1944). One of the most fundamental questions of this program is what makes a simple game a weighted majority game. The...

We study coalitional games where the proceeds from cooperation depend on the entire coalition structure. The coalition structure core (Kóczy, 2007) is a generalisation of the coalition structure core for such games. We introduce a noncooperative, sequential coalition formation model and show...