We study a non-cooperative model of unilateral network formation. Derks et al. [2008b] prove the existence of local-Nash and global-Nash networks for games with payoff functions that satisfy a framework of axiomatic properties. These properties are inspired by the one-way flow model, which is...

In this paper we propose an extension of the core of NTU games from its domain to a larger set of games satisfying a few conditions of well-behavedness. The solution concept is a rather straightforward generalization of the extended core of TU games introduced by Gomez [2003] and is shown to...

This paper deals with the strong constrained egalitarian solution introduced by Dutta and Ray (1991). We show that this solution yields the weak constrained egalitarian allocations (Dutta and Ray, 1989) associated to a finite family of convex games. This relationship makes it possible to define...

We generalize the null player property (satisfied by the Shapley value) and nullifying player property (satisfied by the equal division solution) to the so-called delta-reducing player property, stating that a delta-reducing player (being a player such that any coalition containing this player...

We generalize the null player property (satisfied by the Shapley value) and nullifying player property (satisfied by the equal division solution) to the so-called delta-reducing player property, stating that a delta-reducing player (being a player such that any coalition containing this player...

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

How can we count and list all the Banzhaf or Shapley-Shubik index of power configurations for a given number of players? There is no formula in the literature that may give the cardinal of such a set, and moreover, even if this formula had existed, there is no formula which gives the...

We consider an n-player bargaining problem where the utility possibility set is compact, convex, and stricly comprehensive. We show that a stationary subgame perfect Nash equilibrium exists, and that, if the Pareto surface is differentiable, all such equilibria converge to the Nash bargaining...