In this paper we generalize the concept of a non-transferable utility game by introducing the concept of a socially structured game.A socially structured game is given by a set of players, a possibly empty collection of internal organizations on any subset of players, for any internal...

We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players, for instance a hierarchical ordering or a dominance relation.The social structure is utilized to refine the core of the game, being the set of payoffs to the...

A cooperative game with transferable utility -or simply a TU-game- describes a situation in which players can obtain certain payoffs by cooperation.A value function for these games is a function which assigns to every such a game a distribution of the payoffs over the players in the game.An...

We describe non-cooperative game models and discuss game theoretic solution<br/>concepts. Some applications are also noted. Conventional theory focuses on the<br/>question ‘how will rational players play?’, and has the Nash equilibrium at its core.<br/>We discuss this concept and its interpretations, as...

This paper introduces a simple extensive form pricing game.The Bertrand outcome is a Nash equilibrium outcome in this game, but it is not necessarily subgame perfect.The subgame perfect equilibrium outcome features the following comparative static properties.The more similar firms are, the...

This paper analyzes convex congestion network problems.It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore an easy way of determining if a given network is...