We characterize the Pareto correspondence, the core and the Walras solution using the axioms of consistency, converse consistency and one-person rationality. Consistency and its converse are defined with respect to suitably constructed reduced economies for each case. Our results hold for the well-known class of coalitional production economies, which covers exchange economies as a particular c...

We propose a model of posted prices in networks. The model maps traditional concepts of market power, competition and double marginalization into networks, allowing for the study of pricing in complex structures of intermediation, such as supply chains, transportation and communication networks and financial brokerage. We provide a complete characterization of equilibrium prices. Our experiment...

Stable networks of order  where  is a natural number refer to those networks that are immune to coalitional deviation of size  or less. In this paper, we introduce stability of a finite order and examine its relation with efficient networks under anonymous and component additive value functions and the component-wise egalitarian allocation rule. In particular, we examine shapes of networks o...

We propose a semi-cooperative game theoretic approach to check whether a given coalition is stable in a Bayesian game with independent private values. The ex ante expected utilities of coalitions, at an incentive compatible (noncooperative) coalitional equilibrium, describe a (cooperative) partition form game. A coalition is core-stable if the core of a suitable characteristic function, derived...

Economic activities, both on the macro and micro level, often entail wide-spread externalities. This in turn leads to disputes regarding the compensation levels to the various parties affected. We propose a method of deciding upon the distribution of the gains (costs) of cooperation in the presence of externalities when forming the grand coalition is efficient. We show that any sharing rule sat...

This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games whose core is equal to the core of the combined game. On the other hand, for non balanced games, the binary relation associating two component games whose combination has an empty ...

We study Myerson’s incomplete information bargaining solution under the assumption of verifiable types. For the case of an informed principal, in which one individual has all the bargaining power, we provide exact characterizations both from the non cooperative and from the cooperative perspective. We then show that the axiomatic characterization can be extended to the case in which both indivi...

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. ...

An appropriate (interim) notion of the core for an economy with incomplete information depends on the amount of information that coalitions can share. The coarse and fine core, as originally defined by Wilson (1978), correspond to two polar cases, involving no information sharing and arbitrary information sharing, respectively. We propose a new core notion, the credible core, which incorporates...

Network situations as introduced by Jackson and Wolinsky (1996) incorporate the influence of the architecture of a network rather than just the connectivity it provides and thereby provide a more flexible setting than communication situations, which consist of a game with transferable utility and a network. We characterize the position value for network situations along the lines of the charact...