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

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

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

We study allocation rules that are robust to coalitional manipulation by transferring, merging, or splitting individual characteristics among coalition partners (e.g. merging or splitting claims in bankruptcy problems). Coalition formation is restricted by an exogenous network (a non-directed...

In an abstract model of division problems, we study division rules that are not manipulable through a reallocation of individual characteristic vectors within a coalition (e.g. reallocation of claims in bankruptcy problems). A coalition can be formed if members of the coalition are connected on...

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