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...

This paper gives a concrete example of a nondictatorial, coalitionally strategyproof social choice function for countably infinite societies. The function is defined for those profiles such that for each alternative, the coalition that prefers it the most is gdescribable.h The gdescribableh...

In a framework allowing infinitely many individuals, I prove that coalitionally strategyproof social choice functions satisfy gtops only.h That is, they depend only on which alternative each individual prefers the most, not on which alternative she prefers the second most, the third, . . . , or...

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...

For infinite societies, Fishburn (1970), Kirman and Sondermann (1972), and Armstrong (1980) gave a nonconstructive proof of the existence of a social welfare function satisfying Arrowfs conditions (Unanimity, Independence, and Nondictatorship). This paper improves on their results by (i) giving...

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...

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 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,...

We examine a new class of games, which we call social games, where players not only choose strategies but also choose with whom they play. A group of players who are dissatisfied with the play of their current partners can join together and play a new equilibrium. This imposes new refinements on...

In this paper we characterize the set of rules satisfying additivity on the estate along with additivity on the estate and the claims in bankruptcy problems and other related problems. Moreover, new characterizations of the well known rules based on the principles of "equal award", "equal loss",...