Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by defining a social choice correspondence that is based on the solution rather than on its...

Consider a model of bargaining, in which two players, 1 and 2, share a pie of size y. The bargaining environment is described by a set of parameters [lamda] that may affect agents' preferences over the agreement sharing, the status quo outcome, or both. The outcomes (i.e., whether an agreement...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

Selfish, strategic players may benefit from cooperation, provided they reach agreement. It is therefore important to construct mechanisms that facilitate such cooperation, especially in the case of asymmetric private information. The two major issues are: (1) singling out a fair and efficient...

We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph G = (N;E), with an integer vertex capacity function b and an edge weighting w. The set N consists of a number of players that are to form a set M is a subset of E of 2-player...

Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled...

In a dynamic model of assignment problems, small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or...

We provide a new proof of the non-emptiness of approximate cores of games with many players of a finite number of types. Earlier papers in the literature proceed by showing that, for games with many players, equal-treatment cores of their "balanced cover games", which are non-empty, can be...