Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

Economic agents care about their relative well-being, and the comparisons are usually local. We capture this using a network model, in which an agent's payoff depends on the ranking of their allocation among their network neighbors’. Given a network, an allocation is called α-stable if no...

I develop a model of collaboration between tournament participants in which agents collaborate in pairs, and an endogenous structure of collaboration is represented by a weighted network. The agents are forward-looking and capable of coordination; they value collaboration with others and higher...

This paper extends the theory of endogenous coalition formation, with complete information and transferable utility, to the overlapping case. We propose a cover function bargaining game which allows the formation of overlapping coalitions at equilibrium. We show the existence of subgame perfect...

We consider an abstract model of division problems where each agent is identi- fied by a characteristic vector. Agents are situated on a network (a non-directed graph) and any connected coalition can reallocate members¡¯ characteristics (e.g. reallocation of claims in bankruptcy problems). A...

This paper extends the theory of endogenous coalition formation, with complete information and transferable utility, to the overlapping case. We propose a cover function bargaining game which allows the formation of overlapping coalitions at equilibrium. We show the existence of subgame perfect...

In all social and economic interactions, individuals or coalitions choose not only with whom to interact but how to interact, and over time both the structure (the "with whom") and the strategy ("the how") of interactions change. Our objectives here are to model the structure and strategy of...

We consider a communications network in which users transmit beneficial information to each other at a cost. We pinpoint conditions under which the induced cooperative game is supermodular (convex). Our analysis is in a lattice-theoretic framework, which is at once simple and able to encompass a...

This paper explores the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members. We assume that any distribution of value across the network must be stable with respect to coalitional deviations, and that players can form a...

This paper analyzes congestion effects on network situations from a cooperative game theoretic perspective. In network situations players have to connect themselves to a source. Since we consider publicly available networks any group of players is allowed to use the entire network to establish...