Invariance and randomness in the Nash program for coalitional games

By introducing physical outcomes in coalitional games we note that coalitional games and social choice problems are equivalent (implying that so are the theory of implementation and the Nash program). This facilitates the understanding of the role of invariance and randomness in the Nash program. Also, the extent to which mechanisms in the Nash program perform ``real implementation'' is examined.

All assignment games with the same core have the same nucleolus

There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also coincide. To show this, we prove that the nucleolus of an assignment game coincides with that of its buyer-seller exact representative

All assignment games with the same core have the same nucleolus

There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also coincide. To show this, we prove that the nucleolus of an assignment game coincides with that of its buyer-seller exact representative

Enjoying cooperative games: The R package GameTheory

This paper focuses on cooperative games with transferable utility. We propose the computation of two solutions, the Shapley value for n agents and the nucleolus with a maximum of four agents. The current approach is also focused on conflicting claims problems, a particular case of coalitional games. We provide the computation of the most well-known and used claims solutions: the proportional, the constrained equal awards, the constrained equal losses, the Talmud and the random arrival rules. Keywords: Cooperative game, Shapley value, nucleolus, claims problem, claims rule, bankruptcy.

Lexicographic allocations and extreme core payoffs: the case of assignment games

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationship between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationship. Our main result is the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. As byproducts, we show that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. This provides a way to compute the Alexia value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.

A note on the Lorenz-maximal allocations in the imputation set

In this note we introduce the Lorenz stable set and provide an axiomatic characterization in terms of constrained egalitarianism and projection consistency. On the domain of all coalitional games, we find that this solution connects the weak constrained egalitarian solution (Dutta and Ray, 1989) with their strong counterpart (Dutta and Ray, 1991)

Interface gráfica no contexto de teoria dos jogos sob a forma de Java Apples

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Stability property of matchings is a natural solution concept in coalitional market games

Stability of matchings was proved to be a new cooperative equilibrium concept in Sotomayor (Dynamics and equilibrium: essays in honor to D. Gale, 1992). That paper introduces the innovation of treating as multi-dimensional the payoff of a player with a quota greater than one. This is done for the many-to-many matching model with additively separable utilities, for which the stability concept is defined. It is then proved, via linear programming, that the set of stable outcomes is nonempty and it may be strictly bigger than the set of dual solutions and strictly smaller than the core. The present paper defines a general concept of stability and shows that this concept is a natural solution concept, stronger than the core concept, for a much more general coalitional game than a matching game. Instead of mutual agreements inside partnerships, the players are allowed to make collective agreements inside coalitions of any size and to distribute his labor among them. A collective agreement determines the level of labor at which the coalition operates and the division, among its members, of the income generated by the coalition. An allocation specifies a set of collective agreements for each player.

Cooperative games in strategic form

In this paper we view bargaining and cooperation as an interaction superimposed on a strategic form game. A multistage bargaining procedure for N players, the proposer commitment procedure, is presented. It is inspired by Nash s two-player variable-threat model; a key feature is the commitment to threats. We establish links to classical cooperative game theory solutions, such as the Shapley value in the transferable utility case. However, we show that even in standard pure exchange economies the traditional coalitional function may not be adequate when utilities are not transferable.

Olson vs. Coase: Coalitional worth in conflict

We analyze a model of conflict with endogenous choice of effort, wheresubsets of the contenders may force the resolution to be sequential:First the alliance fights it out with the rest and in case they win later they fight it out among themselves. For three-player games, wefind that it will not be in the interest of any two of them to form analliance. We obtain this result under two different scenarios:equidistant preferences with varying relative strengths, and vicinityof preferences with equal distribution of power. We conclude that thecommonly made assumption of super-additive coalitional worth is suspect.

Coalitionally monotonic set-solutions for cooperative TU games

A static comparative study on set-solutions for cooperative TU games is carried out. The analysis focuses on studying the compatibility between two classical and reasonable properties introduced by Young (1985) in the context of single valued solutions, namely core-selection and coalitional monotonicity. As the main result, it is showed that coalitional monotonicity is not only incompatible with the core-selection property but also with the bargaining-selection property. This new impossibility result reinforces the tradeoff between these kinds of interesting and intuitive economic properties. Positive results about compatibility between desirable economic properties are given replacing the core selection requirement by the core-extension property.

Coalitionally monotonic set-solutions for cooperative TU games

A static comparative study on set-solutions for cooperative TU games is carried out. The analysis focuses on studying the compatibility between two classical and reasonable properties introduced by Young (1985) in the context of single valued solutions, namely core-selection and coalitional monotonicity. As the main result, it is showed that coalitional monotonicity is not only incompatible with the core-selection property but also with the bargaining-selection property. This new impossibility result reinforces the tradeoff between these kinds of interesting and intuitive economic properties. Positive results about compatibility between desirable economic properties are given replacing the core selection requirement by the core-extension property.

Cooperative games with size-truncated information

[Eng] We study the marginal worth vectors and their convex hull, the socalled Weber set, from the original coalitional game and the transformed one, which is called the Weber set of level k. We prove that the core of the original game is included in each of the Weber set of level k, for any k, and that the Weber sets of consecutive levels form a chain if and only if the original game is 0-monotone. Even if the game is not 0-monotone, the intersection of the Weber sets for consecutive levels is always not empty, what is not the case for non-consecutive ones. Spanish education system.

Cooperative games with size-truncated information

[Eng] We study the marginal worth vectors and their convex hull, the socalled Weber set, from the original coalitional game and the transformed one, which is called the Weber set of level k. We prove that the core of the original game is included in each of the Weber set of level k, for any k, and that the Weber sets of consecutive levels form a chain if and only if the original game is 0-monotone. Even if the game is not 0-monotone, the intersection of the Weber sets for consecutive levels is always not empty, what is not the case for non-consecutive ones. Spanish education system.