The extended and generalized Shapley value: Simultaneous consideration of coalitional externalities and coalitional structure

The Shapley value assigns, to each game that is adequately represented by its characteristic function, an outcome for each player. An elaboration on the Shapley value that assigns, to characteristic function games, a “partition function” outcome is broadly established and accepted, but elaborations to encompass games with externalities (represented by partition functions) are not. Here, I show that simultaneous consideration of the two elaborations (“generalization” and “extension”) obtains a unique Shapley-type value for games in partition function form. The key requirement is that the “Extended, Generalized Shapley Value” (EGSV) should be “recursive”: the EGSV of any game should be the EGSV of itself. This requirement forces us to ignore all but the payoffs to bilateral partitions. The EGSV can be conceptualized as the ex ante value of a process of successive bilateral amalgamations. Previous Shapley value extensions, if generalized, are not recursive; indeed, they iterate to the EGSV.     

Axiomatizations of two types of Shapley values for games on union closed systems

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the Shapley value. In the literature various models of games with restricted cooperation can be found. So, instead of allowing all subsets of the player set N to form, it is assumed that the set of feasible coalitions is a subset of the power set of N. In this paper, we consider such sets of feasible coalitions that are closed under union, i.e. for any two feasible coalitions also their union is feasible. We consider and axiomatize two solutions or rules for these games that generalize the Shapley value: one is obtained as the conjunctive permission value using a corresponding superior graph, the other is defined as the Shapley value of a modified game similar as the Myerson value for games with limited communication.     

Government versus Opposition: Who Should be Who in the 16th German Bundestag?

We model the process of coalition formation in the 16th German Bundestag as a hedonic coalition formation game. In order to induce players' preferences in the game we apply the Shapley value of the simple game describing all winning coalitions in the Bundestag. Using different stability notions for hedonic games we prove that the ``most' stable government is formed by the Union Parties together with the Social Democratic Party.     

A note on equivalence of consistency and bilateral consistency through converse consistency

In the framework of (set-valued or single-valued) solutions for coalitional games with transferable utility, the three notions of consistency, bilateral consistency, and converse consistency are frequently used to provide axiomatic characterizations of a particular solution (like the core, prekernel, prenucleolus, Shapley value). Our main equivalence theorem claims that a solution satisfies consistency (with respect to an arbitrary reduced game) if and only if the solution satisfies both bilateral consistency and converse consistency (with respect to the same reduced game). The equivalence theorem presumes transitivity of the reduced game technique as well as difference independence on payoff vectors for two-person reduced games.     

The multilinear extension and the coalition structure value

The multilinear extension has been shown to be an effective tool for computing the Shapley value of an n-person game. We modify here the method for the multilinear extension to calculate the modified coalition structure value (CS-value) for such games.     

The museum pass game and its value

We discuss a game in which service providers (e.g., museums) team up in offering a limited time access pass allowing unlimited usage of their services. In this game, a natural way to allocate the joint income from the sale of passes among the service providers is by using the Shapley value. We show that, for the particular game considered, the Shapley value takes a very intuitive and computationally simple form.     

Market Games in Large Economies with a Finite Number of Types

We study market games derived from an exchange economy with a continuum of agents, each having one of finitely many possible types. The type of agent determines his initial endowment and utility function. It is shown that, unlike the well-known Shapley–Shubik theorem on market games (Shapley and Shubik in J Econ Theory 1:9–25, 1969), there might be a (fuzzy) game in which each of its sub-games has a non-empty core and, nevertheless, it is not a market game. It turns out that, in order to be a market game, a game needs also to be homogeneous. We also study investment games – which are fuzzy games obtained from an economy with a finite number of agents cooperating in one or more joint projects. It is argued that the usual definition of the core is inappropriate for such a model. We therefore introduce and analyze the new notion of comprehensive core. This solution concept seems to be more suitable for such a scenario. We finally refer to the notion of feasibility of an allocation in games with a large number of players. Some of the results in this paper appear in a previous draft distributed by the name “Cooperative investment games or Population games”. An anonymous referee of Economic Theory is acknowledged for his/her comments     

Coalition formation in general apex games under monotonic power indices

An apex game consists of one apex player and a set of minor players. We identify two key properties of apex games and use them to introduce the class of general apex games. We derive players' preferences over winning coalitions by applying strongly monotonic power indices on such a game and all its subgames and investigate whether there are core stable coalitions in the induced hedonic coalition formation game. Besides several general results, in particular, we develop conditions on the game for the Shapley–Shubik index, the Banzhaf index, and the normalized Banzhaf index.     

Comparable Axiomatizations of Two Allocation Rules for Cooperative Games with Transferable Utility and Their Subclass of Data Games

The axiom of balanced collective contributions is introduced as a collective variant of the axiom of balanced contributions proposed by Myerson. It requires the identical average impact of the withdrawal of any agent from a game on the remaining population. It turns out that the axiom of balanced collective contributions and the classical axiom of efficiency characterize the equal allocation of nonseparable costs, an allocation rule that is extensively used in cost allocation problems and in accounting. In particular, the equal allocation of nonseparable costs coincides with the nucleolus on the class of data games within the European REACH legislation. While our result does not hold on data games, extra axioms enable provision of comparable characterizations of the equal allocation of nonseparable costs and the Shapley value on this class of games.     

A Risk‐Dominant Allocation: Maximizing Coalition Stability

This paper presents a rule to allocate a coalition’s worth for superadditive games with positive externalities. The allocation rule awards each member their outside payoff, plus an equal share of the surplus. The resulting allocation maximizes coalition stability. Stable coalitions are Strong Nash equilibria since no subset of members has an incentive to leave. Similarly, no subset of non‐members has an incentive to join a stable coalition if the game is concave in this region. The allocation is risk‐dominant. All stable coalitions are robust to the maximum probability of 50% that players’ deviate from their individual best‐responses. The paper compares the allocation to the Shapley value and the Nash bargaining solution, and illustrates why these traditional rules result in small coalitions when applied to issues such as international environmental agreements.     

Production-inventory games: A new class of totally balanced combinatorial optimization games

In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its own unit production, inventory-holding and backlogging cost. Cooperation among agents is given by sharing production processes and warehouse facilities: agents in a coalition produce with the cheapest production cost and store with the cheapest inventory cost. We prove that the resulting cooperative game is totally balanced and the Owen set reduces to a singleton: the Owen point. Based on this type of allocation we find a population monotonic allocation scheme for this class of games. Finally, we point out the relationship of the Owen point with other well-known allocation rules such as the nucleolus and the Shapley value.     

Cooperative games in permutational structure

Summary. By a cooperative game in coalitional structure or shortly coalitional game we mean the standard cooperative non-transferable utility game described by a set of payoffs for each coalition being a nonempty subset of the grand coalition of all players. It is well-known that balancedness is a sufficient condition for the nonemptiness of the core of such a cooperative non-transferable utility game. In this paper we consider non-transferable utility games in which for any coalition the set of payoffs depends on a permutation or ordering upon any partition of the coalition into subcoalitions. We call such a game a cooperative game in permutational structure or shortly permutational game. Doing so we extend the scope of the standard cooperative game theory in dealing with economic or political problems. Next we define the concept of core for such games. By introducing balancedness for ordered partitions of coalitions, we prove the nonemptiness of the core of a balanced non-transferable utility permutational game. Moreover we show that the core of a permutational game coincides with the core of an induced game in coalitional structure, but that balancedness of the permutational game need not imply balancedness of the corresponding coalitional game. This leads to a weakening of the conditions for the existence of a nonempty core of a game in coalitional structure, induced by a game in permutational structure. Furthermore, we refine the concept of core for the class of permutational games. We call this refinement the balanced-core of the game and show that the balanced-core of a balanced permutational game is a nonempty subset of the core. The proof of the nonemptiness of the core of a permutational game is based on a new intersection theorem on the unit simplex, which generalizes the well-known intersection theorem of Shapley. Received: October 31, 1995; revised version: February 5, 1997     

A Strategic Implementation of the Shapley Value for the Nested Cost‐Sharing Problem

When agents have different needs for a public facility but serving a given agent allows serving all agents with smaller needs than his without any extra cost, how should the agents divide the cost of the facility among themselves? We provide a strategic implementation of the Shapley value for this class of cost‐sharing problems. We introduce a three‐stage extensive form game that respects individual rationality and show that there is one and only one subgame‐perfect equilibrium outcome of the game. Moreover, it is the allocation assigned by the Shapley value.     

Collusion, Exclusion, and Inclusion in Random-Order Bargaining

This paper examines the profitability of three types of integration in a cooperative game solved by a random-order value ( e.g. the Shapley value). Collusion between players  i  and  j  is a contract merging their resources in the hands of one of them, say  i  . This contract can be represented as a combination of exclusion, which lets  i  exclude  j  's resource but not use it himself, and inclusion, which lets  i  use  j  's resource but not exclude  j  from it. This representation yields a third-difference condition on the characteristic function that determines the profitability of collusion, generalizing existing results for specific games. Namely, collusion is profitable [unprofitable] when the complementarity of the colluding players is reduced [increased] by other players.     

Potentializability and consistency for multi-choice solutions

The paper introduces and discusses several characterizations of the multi-choice Shapley value (introduced by Nouweland et al. in ZOR-Math Methods Oper Res 41:289–311, 1995), on the domain of multi-choice games. These characterizations generalize the potential approach and results of Calvo and Santos (Math Soc Sci 34:175–190, 1997) into this domain, and the relations are treated with the axiomatic approach in Calvo and Santos (Math Soc Sci 40:341–354, 2000). Also, based on the axioms of two-person standardness and consistency, we offer an axiomatization of the multi-choice Shapley value. The authors are grateful to Professor Sjaak Hurkens and the anonymous referees for very helpful suggestions and comments.     

Excluded coalitions and the distribution of power in parliaments

In this article, we introduce a new value for cooperative games. This value is based on the Shapley (1953) value and takes into account that players exclude coalitions with other players. One example of such exclusions are the coalition statements of parliamentary parties. A case study demonstrates the application of the new value for these situations.     

Nash equilibrium in games with incomplete preferences

Summary. This paper investigates Nash equilibrium under the possibility that preferences may be incomplete. I characterize the Nash-equilibrium-set of such a game as the union of the Nash-equilibrium-sets of certain derived games with complete preferences. These games with complete preferences can be derived from the original game by a simple linear procedure, provided that preferences admit a concave vector-representation. These theorems extend some results on finite games by Shapley and Aumann. The applicability of the theoretical results is illustrated with examples from oligopolistic theory, where firms are modelled to aim at maximizing both profits and sales (and thus have multiple objectives). Mixed strategy and trembling hand perfect equilibria are also discussed.Received: 22 September 2003, Revised: 24 June 2004, JEL Classification Numbers: D11, C72, D43.I would like to thank Jean-Pierre Benôit, Juan Dubra, Alejandrio Jofre, Debraj Ray, Kim-Sau Chung and the seminar participants at NYU and at the Universidad de Chile for their comments. I am most grateful to Efe Ok, for his comments, criticism, suggestions and questions.     

ANTI‐DUAL OF ECONOMIC COALITIONAL TU GAMES*

Some well‐known coalitional TU (transferable utility) games applied to specific economic problems are shown to be connected through the relation defined as the anti‐dual. Solutions such as the core, the Shapley value and the nucleolus of anti‐dual games are obtained straightforwardly from original games.     

Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games

This paper axiomatizes the Shapley value on minimum cost spanning tree games by using axioms which are different from those used in network games. Journal of Economic Literature Classification Numbers: C71, A14.