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

In this paper we consider the problem of the control of access to a firm's productive asset, embedding the relevant decisionmakers into a general structure of formal authority relations. Within such an authority structure, each decision maker acts as a principal to some decision makers, while...

In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the...

We introduce the prediction value (PV) as a measure of players' informational importance in probabilistic TU games. The latter combine a standard TU game and a probability distribution over the set of coalitions. Player i's prediction value equals the difference between the conditional...

We develop a model of assignment games with pairwise-identity-dependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...

We consider a model of the 'world' with several regions that may create a unified entity or be partitioned into several unions (countries). The regions have distinct preferences over policies chosen in the country to which they belong and equally share the cost of public policies. It is known...

The nucleolus offers a desirable payoff-sharing solution in cooperative games, thanks to its attractive properties. Although computing the nucleolus is very challenging, the Kohlberg criterion offers a method for verifying whether a solution is the nucleolus in relatively small games (number of...

Consider a group of agents located along a polluted river where every agent must pay a certain cost for cleaning up the polluted river. Following the model of Ni and Wang (2007), we propose the class of alpha-Local Responsibility Sharing methods, which generalizes the Local Responsibility...

A large theoretical literature on value capture following Brandenburger and Stuart (1996) uses cooperative games under complete information to study how and why firms earn supernormal profits. However, firms often have different information, beliefs, or creative foresight. We extend value...

Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled...