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

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

We propose an allocation rule that takes into account the importance of players and their links and characterizes it for a fixed network. Unlike previous rules, our characterization does not require component additivity. Next, we extend it to flexible networks a la Jackson (2005). Finally, we...

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

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 survey the recent literature on the formation of networks. I provide definitions of network games, a number of examples of models from the literature, and discuss some of what is known about the (in)compatibility of overall societal welfare with individual incentives to form and sever links.

In this paper we introduce a new class of cooperative games. We define a characteristic function over the cycles of a digraph. We present a mathematical model for this situation and an axiomatic characterization of a solution for this class of cooperative games. This is introduced as a method to...

In this paper, different merge proof notions for allocation rules at transferable utility games are defined and studied. Merging of a coalition into a single player is considered mainly in two different ways: firstly, merging of only one coalition -where the other (external) players stay as...