In this paper we consider information collecting (IC) situations where an action taker in an uncertain situation can improve his action choices by gathering information from some players who are more informed about the situation. Then the problem of sharing the gains when cooperating with...

In this paper we study cooperative cost games arising from domination problems on graphs.We introduce three games to model the cost allocation problem and we derive a necessary and su cient condition for the balancedness of all three games.Furthermore we study concavity of these games.

The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on a characterization of the T -value in...

We experimentally investigate a bargaining environment in which players negotiate over a xed payment to one player, while the other player receives the residual from a random pie realization after subtracting the xed payment. Contrary to the intuition that risk exposure is detrimental, we show...

When there are three parties, it is well known that the Coase Theorem may not hold even when there are no transaction costs, due to the emptiness of the core of the corresponding cooperative game [Aivazian and Callen (1981)]. We show that the standard Coasean bargaining game involving three...

A generalization of transferable utility cooperative games from the functional forms introduced by von Neumann and Morgenstern (1944, Theory of Games and Economic Behavior) and Lucas and Thrall (1963, Naval Research Logistics Quarterly, 10, 281–298) is proposed to allow for multiple...

Firms sign an integration contract with the purpose of increasing their expected profits from trade and competition with third parties. Gains depend on how the contract improves the partners' production function (e.g. better synergies, organization, etc.), and how it increases their power in the...

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

The paper studies the ordinal equivalence of Linear, Efficient and Symmetry (LES) values in TU-games. It demonstrates that most of the results obtained by Carreras F, Freixas J (2008) in the case of semivalues and simple games are transposable on LES values and the whole TU-games set. In...

This book introduces new concepts for cooperative game theory, and particularly solutions that determine the distribution of a coalitional surplus among the members of the coalition. It also addresses several generalizations of cooperative game theory. Drawing on methods of welfare economics,...