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     

Virtual utility and the core for games with incomplete information

The core is extended to games with incomplete information. The feasible set is characterized by incentive-compatible mechanisms. Blocking is organized at the interim stage by an incentive-compatible mediation plan. Membership of the blocking coalition itself may be determined randomly by the blocking mediator. Nonemptiness of an interim fine core is proven for games with a balanced structure, independent types, and sidepayments. An offer of severance payments may be needed to inhibit blocking. Core allocations are characterized in terms of virtual-utility scales that generalize the weighted-utility scales of the inner core. Mechanisms that achieve core allocations are coalitionally durable.     

Coalitions, agreements and efficiency

If agents negotiate openly and form coalitions, can they reach efficient agreements? We address this issue within a class of coalition formation games with externalities where agents’ preferences depend solely on the coalition structure they are associated with. We derive Ray and Vohra's [Equilibrium binding agreements, J. Econ. Theory 73 (1997) 30-78] notion of equilibrium binding agreements using von Neumann and Morgenstern [Theory of Games and Economic Behavior, Princeton University Press, Princeton, 1944] abstract stable set and then extend it to allow for arbitrary coalitional deviations (as opposed to nested deviations assumed originally). We show that, while the extended notion facilitates the attainment of efficient agreements, inefficient agreements can nevertheless arise, even if utility transfers are possible.     

On the informational efficiency of simple scoring rules

We study information aggregation in large elections. With two candidates, efficient information aggregation is possible (e.g., Feddersen and Pesendorfer [5], [6] and [7]). We show that this result does not extend to elections with more than two candidates. We study a class of simple scoring rules in voting games with Poisson population uncertainty and three candidates. No simple scoring rule aggregates information efficiently, even if preferences are dichotomous and a Condorcet winner always exists. We introduce a weaker criterion of informational efficiency that requires a voting rule to have at least one efficient equilibrium. Only approval voting satisfies this criterion.     

Pillage and property

This paper introduces a class of coalitional games, called pillage games, as a model of Hobbesian anarchy. Any coalition can pillage, costlessly and with certainty, any less powerful coalition. Power is endogenous, so a pillage game does not have a characteristic function, but pillage provides a domination concept that defines a stable set, which represents an endogenous balance of power. Every stable set contains only finitely many allocations, and can be represented as a farsighted core. Additional results are obtained for particular games, including the game in which the power of each coalition is determined by its total wealth.     

On weighted Kalai–Samet solutions for non-transferable utility coalitional form games

We investigate the implications of the axiom of coalitional concavity for non-transferable utility coalitional form games. This axiom says that if the feasible set of some coalition is uncertain whereas the feasible sets of other coalitions are known, then all players in the coalition with the uncertain feasible set should (weakly) benefit from reaching a compromise before the uncertainty is resolved. By imposing this axiom, in addition to other minor axioms, we characterize the weighted Kalai–Samet [Econometrica 53 (1985) 307] solutions: these solutions coincide with the weighted egalitarian solutions on the domain of bargaining problems, and with the weighted Shapley values on the domain of transferable utility coalitional form games.     

Theories of coalitional rationality

This paper generalizes the concept of best response to coalitions of players and offers epistemic definitions of coalitional rationalizability in normal form games. The (best) response of a coalition is defined to be an operator from sets of conjectures to sets of strategies. A strategy is epistemic coalitionally rationalizable if it is consistent with rationality and common certainty that every coalition is rational. A characterization of this solution set is provided for operators satisfying four basic properties. Special attention is devoted to an operator that leads to a solution concept that is generically equivalent to the iteratively defined concept of coalitional rationalizability.     

Cooperation and Institution in Games

Based on recent developments in non‐cooperative coalitional bargaining theory, I review game theoretical analyses of cooperation and institution. First, I present basic results of the random‐proposer model and apply them to the problem of involuntary unemployment in a labour market. I discuss extensions to cooperative games with externalities and incomplete information. Next, I consider the enforceability of an agreement as an institutional foundation of cooperation. I re‐examine the contractarian approach to the problem of cooperation from the viewpoint that individuals may voluntarily create an enforcement institution.     

Cores of combined games

This paper studies the core of combined games, obtained by summing different coalitional games when bargaining over multiple independent issues. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games to determine whether the core of the combined game coincides with the sum of the cores of its components.     

Semi-core equivalence

Summary. The main requirements for equivalence of the core of an economy and the Walrasian equilibrium allocations are largeness and the freedom to form almost arbitrary coalitions in the Edgeworthian barter processes. We investigate whether constraints on coalition formation and coalitional barter alter these insights. Our notion of the semi-core imposes a restriction on the collection of formable coalitions that does not affect the fundamental equivalence property. Using our concept of the contract-core we show that additional constraints on coalitional barter can only be alleviated within an environment with sufficiently many formable coalitions: besides a contract-core equivalence theorem we show certain non-equivalence results.Received: December 11, 1995; revised version: September 17, 1996This revised version was published online in February 2005 with corrections to the cover date.     

Coalition formation as a dynamic process

We study coalition formation as an ongoing, dynamic process, with payoffs generated as coalitions form, disintegrate, or regroup. A process of coalition formation (PCF) is an equilibrium if a coalitional move to some other state can be “justified” by the expectation of higher future value, compared to inaction. This future value, in turn, is endogenous: it depends on coalitional movements at each node. We study existence of equilibrium PCFs. We connect deterministic equilibrium PCFs with unique absorbing state to the core, and equilibrium PCFs with multiple absorbing states to the largest consistent set. In addition, we study cyclical as well as stochastic equilibrium PCFs.     

Full revelation of information in Sender-Receiver games of persuasion

We provide necessary and sufficient conditions on both players' preferences and information that can be certified for a Sender-Receiver game to possess a separating equilibrium, as well as sufficient conditions for every equilibrium of such a game to be separating. Accordingly, we generalize Seidmann and Winter's [D.J. Seidmann, E. Winter, Strategic information transmission with verifiable messages, Econometrica 65 (1997) 163-170] results to games with partial provability.     

Group play in games and the role of consent in network formation

We study games played between groups of players, where a given group decides which strategy it will play through a vote by its members. When groups consist of two voting players, our games can also be interpreted as network-formation games. In experiments on Stag Hunt games, we find a stark contrast between how groups and individuals play, with payoffs playing a primary role in equilibrium selection when individuals play, but the structure of the voting rule playing the primary role when groups play. We develop a new solution concept, robust-belief equilibrium, which explains the data that we observe. We provide results showing that this solution concept has application beyond the particular games in our experiments.     

On the Least Core and the Mas-Colell Bargaining Set

We show that the least core of a TU coalitional game with a finite set of players is contained in the Mas-Colell bargaining set. This result is extended to games with a measurable space of players in which the worth of the grand coalition is at least that of any other coalition in the game. As a consequence, we obtain an existence theorem for the Mas-Colell bargaining set in TU games with a measurable space of players. Journal of Economic Literature Classification Number: C71.     

The type-agent core for exchange economies with asymmetric information

The type-agent core is a new solution concept for exchange economies with asymmetric information. It coincides with the set of subgame-perfect equilibrium outcomes of a simple competitive screening game. Uninformed intermediaries help the agents to cooperate in an attempt to make some profit. The paper extends the work of Perez-Castrillo [Cooperative outcomes through non-cooperative games, Games Econ. Behav. 7 (1994) 428-440] to exchange economies with non-transferable utility and asymmetric information. The type-agent core is a subset of Wilson's coarse core [Wilson, Information, efficiency, and the core of an economy, Econometrica 46 (1978) 807-816]. It is never empty, even though it may be a strict subset of Wilson's fine core. In addition, it converges towards the set of constrained market equilibria as the economy is replicated.     

Dynamic coalitional equilibrium

We study coalition formation processes of Konishi and Ray (2003) [27]. It is shown that an absorbing and deterministic process of coalition formation that also forms an equilibrium - satisfies a coalitional one-deviation property - does exist if one allows the process to be history dependent. All such dynamic equilibrium processes of coalition formation are characterized. Absorbing outcomes of dynamic equilibrium processes are also identified. It is shown that they always constitute a subset of the largest consistent set of Chwe (1994) [11]. A procedure that identifies a dynamic equilibrium process of coalition formation in finite time is constructed.     

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.     

Hierarchies of ambiguous beliefs

We present a theory of interactive beliefs analogous to Mertens and Zamir [Formulation of Bayesian analysis for games with incomplete information, Int. J. Game Theory 14 (1985) 1-29] and Brandenburger and Dekel [Hierarchies of beliefs and common knowledge, J. Econ. Theory 59 (1993) 189-198] that allows for hierarchies of ambiguity. Each agent is allowed a compact set of beliefs at each level, rather than just a single belief as in the standard model. We propose appropriate definitions of coherency and common knowledge for our types. Common knowledge of coherency closes the model, in the sense that each type homeomorphically encodes a compact set of beliefs over the others’ types. This space universally embeds every implicit type space of ambiguous beliefs in a beliefs-preserving manner. An extension to ambiguous conditional probability systems [P. Battigalli, M. Siniscalchi, Hierarchies of conditional beliefs and interactive epistemology in dynamic games, J. Econ. Theory 88 (1999) 188-230] is presented. The standard universal type space and the universal space of compact continuous possibility structures are epistemically identified as subsets.     

Nominal bargaining power, selection protocol, and discounting in legislative bargaining

The comparative static predictions of the Baron and Ferejohn [Baron, D.P., and Ferejohn, J.A., (1989). Bargaining in legislatures, American Political Science Review 83 (4), 1181-1206] model better organize behavior in legislative bargaining experiments than Gamson's Law. Regressions similar to those employed in field data produce results seemingly in support of Gamson's Law (even when using data generated by simulating agents who behave according to the Baron-Ferejohn model), but this is determined by the selection protocol which recognizes voting blocks in proportion to the number of votes controlled. Proposer power is not nearly as strong as predicted in the closed rule Baron and Ferejohn model, as coalition partners refuse to take the small shares given by the continuation value of the game. Discounting pushes behavior in the direction predicted by Baron and Ferejohn but has a much smaller effect than predicted.     

A limit characterization of belief-free equilibrium payoffs in repeated games

The present paper studies repeated games with private monitoring, and characterizes the set of belief-free equilibrium payoffs in the limit as the discount factor approaches one and the noise on private information vanishes. Contrary to the conjecture by Ely et al. [J.C. Ely, J. Hörner, W. Olszewski, Belief-free equilibria in repeated games, Econometrica 73 (2005) 377-415], the equilibrium payoff set is computed by the same formula, no matter how many players there are. As an application of this result, a version of the folk theorem is established for N-player prisoner's dilemma games.