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

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

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

Ostrovsky [10] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents’ preferences satisfy same side substitutability and cross side complementarity....

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 study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical...

A symmetric network consists of a set of positions and a set of bilateral links between these positions. Examples of such networks are exchange networks, communication networks, disease transmission networks, control networks etc. For every symmetric network we define a cooperative transferable...

Local routing protocols in scale free networks have been extensively studied. In this paper we consider a wireless contextualization of this routing problem and analyze on the one hand how cooperation affects network efficiency, and on the other hand the stability of cooperation structures....