We conducted a sensitivity analysis of results in weighted voting experiments by varying the following two features of the protocol by Montero et al. (2008): (a) the way subjects' roles are reassigned in each round (random versus semi-fixed roles) and (b) the number of proposals that subjects...

Finding a solution concept is one of the central problems in cooperative game theory, and the notion of core is the most popular solution concept since it is based on some rationality condition. In many real situations, not all possible coalitions can form, so that classical TU-games cannot be...

In pure exchange economies, a poor attention has been given to how the individual consumption possibilities of the members of a coalition should be represented. It seems economically reasonable that our knowledge and our possibility to make decisions depend on the coalition we belong to. We...

Bicooperative games generalize classical cooperative games in the sense that a player is allowed to play in favor or against some aim, besides non participation. Bicapacities are monotonic bicooperative games, they are useful in decision making where underlying scales are of bipolar nature,...

For any TU game and any ranking of players, the set of all preimputations compat- ible with the ranking, equipped with the Lorenz order, is a bounded join semi-lattice. Furthermore the set admits as sublattice the S-Lorenz core intersected with the region compatible with the ranking. This result...

The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider communication graphs with weighted edges, and we define arbitrary ways of partitioning any subset of a graph, which we call correspondences. A particularly useful way to...

The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider communication graphs with weighted edges, and we define arbitrary ways of partitioning any subset of a graph, which we call correspondences. A particularly useful way to...

We study cooperative games associated with a communication structure which takes into account a level of communication between players. Let us consider an undirected communication graph : each node represents a player and there is an edge between two nodes if the corresponding players can...

The paper proposes a new concept of solution for TU games, called multicoalitional solution, which makes sense in the context of production games, that is, where v(S) is the production or income per unit of time. By contrast to classical solutions where elements of the solution are payoff...

The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider communication graphs with weighted edges, and we define arbitrary ways of partitioning any subset of a graph, which we call correspondences. A particularly useful way to...