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

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

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value of a game is an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats...

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

We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through wage offers and wage demands, firms compete over workers and workers compete over jobs. Firms make hire-and-fire decisions dependent on the wages of their own workers and on the...

We consider the division problems in which a resource must be distributed considering agents' references. We analize this problems in a multidimensional context, we consider that agents have multiple references. For division of the amount available in these situations, we design rules that take...

This paper is a survey of the work in the Nash program for coalitional games, a research agenda proposed by Nash (1953) to bridge the gap between the non-cooperative and cooperative approaches to game theory.

The Shapley-Ichiishi result states that a game is convex if and only if the convex hull of marginal vectors equals the core. In this paper we generalize this result by distinguishing equivalence classes of balanced games that share the same core structure. We then associate a system of linear...