Steady state equilibria in heterogeneous agent matching models with search frictions have been shown to exist in Shimer and Smith (2000) under the assumption of a quadratic search technology. We extend their analysis to the commonly investigated linear search technology.

Ostrovsky [10] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents’ preferences satisfy same side substitutability and cross side complementarity....

Games of imperfect information distribute information unevenly amongst parties. Recently, parties have been claimed to hold preferences purely over such procedural aspects. Here, I explore the impact purely procedural preferences exert if agents are without influence on the procedure itself. I...

Common wisdom holds that the introduction of a non-binding minimum wage is irrelevant for actual wages and employment. Empirical and experimental research, however, has shown that the introduction of a minimum wage can raise even those wages that were already above the new minimum wage. In this...

We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von...

A coalitional matching is a two-sided matching problem in which agents on each side of the market may form coalitions such as student groups and research teams who - when matched - form universities. We assume that each researcher has preferences over the research teams he would like to work in...

In this paper we make use of a unique dataset collected in the central train station of Kiel, Germany. A group ticket is used by individual proposers who search for co-travelers to share the ride with shortly before the train departure. The bargaining behavior resembles the Ultimatum game to the...

We investigate the matching algorithm used by the German central clearinghouse for university admissions (ZVS) in medicine and related subjects. This mechanism consists of three procedures based on final grades from school (Abiturbestenverfahren, Auswahlverfahren der Hochschulen) and on waiting...

Bargaining over two issues as a bundle permits credible cheap talk about their relative importance even when interests are directly opposed on each issue. The resulting communication gains can exceed the gains from bundling previously identified in the monopoly pricing literature.

This paper extends the theory of endogenous coalition formation, with complete information and transferable utility, to the overlapping case. We propose a cover function bargaining game which allows the formation of overlapping coalitions at equilibrium. We show the existence of subgame perfect...