We examine a simple bargaining setting, where heterogeneous buyers and sellers are repeatedly matched with each other. We begin by characterizing efficiency in such a dynamic setting, and discuss how it differs from efficiency in a centralized static setting. We then study the allocations which...

Many local public goods are provided by coalitions and some of them have network effects. Namely, people prefer to consume a public good in a coalition with more members. This paper adopts the Drèze and Greenberg (1980) type utility function where players have preferences over goods as well as...

We study how individuals divide themselves into coalitions and choose a public alternative for each coalition. When preferences have consecutive support and coalition feasible sets are positively population- responsive, the proposed consecutive benevolence solution generates allocations...

This paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of...

We introduce a non-cooperative model of bargaining when players are divided into coalitions. The model is a modification of the mechanism in Vidal-Puga (Economic Theory, 2005) so that all the players have the same chances to make proposals. This means that players maintain their own 'right to...

The mechanism by Hart and Mas-Colell (1996) for NTU games is generalized so that a coalition structure among players is taken into account. The new mechanism yields the Owen value for TU games with coalition structure as well as the consistent value (Maschler and Owen 1989, 1992) for NTU games...

The Suppes-Sen dominance relation is a weak and widely accepted criterion of distributive justice. We propose its application to Nash bargaining theory. The Nash Bargaining Solution (NBS) is characterised by replacing the contriversial Independence of Irrelevant Alternatives axiom with an axiom...

Shapley proved the existence of an ordinal, symmetric and efficient solution for three-player bargaining problems. Ordinality refers to the covariance of the solution with respect to order-preserving transformations of utilities. The construction of this solution is based on a special feature of...

We study a simple bargaining mechanism in which each player puts a prize to his resources before leaving the game. The only expected final equilibrium payoff can be defined by means of selective marginal contributions vectors, and it coincides with the Shapley value for convex games. Moreover,...

An expanded model of value in cooperative games is presented in which value has either a linear or a proportional mode, and NTU value has either an input or an output basis. In TU games, the modes correspond to the Shapley (1953) and proportional (Feldman (1999) and Ortmann (2000)) values. In...