An important open problem in the theory of TU-games is to determine whether a game has a stable core (Von Neumann-Morgenstern solution (1944)). This seems to be a rather difficult combinatorial problem. There are many sufficient conditions for core-stability. Convexity is probably the best known...

Games with cooperation structure are cooperative games with a family of feasible coalitions, that describe which coalitions can negotiate in the game. We study a model of cooperation structure and the corresponding restricted game, in which the feasible coalitions are those belonging to a...

We prove that the Banzhaf value is a unique symmetric solution having the dummy player property, the marginal contributions property introduced by Young (1985) and satisfying a very natural reduction axiom of Lehrer (1988)

We consider the problem of valuing inputs in a production environment in which input supply is uncertain. Inputs can be workers in a firm, risk factors for a disease, securities in a financial market, or nodes in a networked economy. Each input takes its values from a finite set, and uncertainty...

We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players. The social structure is utilized to refine the core of the game. For every coalition the relative strength of a player within that coalition is induced by the...

We consider cooperative games with transferable utility (TU-games), in which we allow for a social structure on the set of players. The social structure is utilized to refine the core of the game. For every coalition the relative strength of a player within that coalition is induced by the...

The Hart-and-Mas-Colell bargaining model [Hart and Mas-Colell (2010). “Bargaining and Cooperation in Strategic Form Games.” Journal of the European Economics Association, 8, 7-33], which is based on strategic form games, is a very promising model possessing many beautiful features....

The process of computing the nucleolus of arbitrary utility games is notoriously hard. A number of papers have appeared in which the nucleolus is computed by an algorithm in which either one or a huge number of huge linear programs have to be solved. We show that on the class of veto-rich games,...

We consider multichoice NTU games, i.e., cooperative NTU games in which players can participate in the game with several levels of activity. For these games, we define and characterize axiomatically the multichoice consistent value, which is a generalization of the consistent NTU value for NTU...

Selfish, strategic players may benefit from cooperation, provided they reach agreement. It is therefore important to construct mechanisms that facilitate such cooperation, especially in the case of asymmetric private information. The two major issues are: (1) singling out a fair and efficient...