We develop a model of assignment games with pairwise-identity-dependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...

Solution concepts in social environments use either a direct or indirect dominance relationship, depending on whether it is assumed that agents are myopic or farsighted. Direct dominance implies indirect dominance, but not the reverse. Hence, the predicted outcomes when assuming myopic (direct)...

Public school systems generally use one of the three competing mechanisms – the Boston mechanism, the deferred acceptance mechanism and the top trading cycle mechanism – for assigning students to specific schools. Although the literature generally claims that the Boston mechanism is Pareto...

We develop observable restrictions of well-known theories of bargaining over money. We suppose that we observe a finite data set of bargaining outcomes, including data on allocations and disagreement points, but no information on utility functions. We ask when a given theory could generate the...

This note studies the noncooperative foundations of von Neumann- Morgenstern (vN-M) stable sets in voting games. To do so, we study Markov perfect equilibria of a noncooperative legislative bargaining game, based on underlying simple games. The following result emerges from such an exercise:...

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

It seems that decisions in many voting bodies might be described by a two-stage decision in which the first stage is a bargaining process and the second is a vote that is often a formality. This does not mean that the voting is irrelevant, but, rather, that it limits the threats that may be made...

For each assignment market, an associated bargaining problem is defined and some bargaining solutions to this problem are analyzed. For a particular choice of the disagreement point, the Nash solution and the Kalai-Smorodinsky solution coincide and give the midpoint between the buyers-optimal...

We propose and analyze a new solution concept, theR-solution, for three-person, transferable utility, cooperative games. In the spirit of the Nash Bargaining Solution, our concept is founded on the predicted outcomes of simultaneous, two-party negotiations that would be the alternative to the...

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