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

This paper models the instability of peace agreements, motivated by the empirical regularity with which peace agreements tend to break down following civil war. When war provides opportunities for profit to one side, or when other difficulties such as historical grievances exist, peace may...

This paper studies a decentralized, dynamic matching and bargaining market: buyers and sellers are matched into pairs. Traders exit the market at a constant rate, inducing search costs (frictions). All price offers are made by sellers. Despite the fact that sellers have all the bargaining power...

We discuss a model, in which two agents may distribute finitely many objects among themselves. The conflict is resolved by means of a market procedure. Depending on the specifications, this procedure serves to implement bargaining solutions such as the discrete Raiffa solution, the...

Top responsiveness is introduced by Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] as a property which induces a rich domain on players's preferences in hedonic games, and guarantees the existence of core stable partitions. We strengthen this observation by proving the...

We discuss two support results for the Kalai-Smorodinsky bargaining solution in the context of an object division problem involving two agents. Allocations of objects resulting from strategic interaction are obtained as a demand vector in a specific market. For the first support result games in...

We consider general two-sided matching markets, so-called matching with contracts markets as introduced by Hatfield and Milgrom (2005), and analyze (Maskin) monotonic and Nash implementable solutions. We show that for matching with contracts markets the stable correspondence is monotonic and...

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