We consider a pairwise kidney exchange model. Roth et al. (2005) define priority matchings of the model and introduce a mechanism to derive them. In this paper, we re-examine the priority matching. First, we consider a general priority ordering where multiple patients may hold equal priority. We...

A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a close structural connection between Pareto optimality and perfection that has various algorithmic consequences for coalition formation. Based on this insight, we formulate the...

When men and women are objectively ranked in a marriage problem, say by beauty, then pairing individuals of equal rank is the only stable matching. We generalize this observation by providing bounds on the size of the rank gap between mates in a stable matching in terms of the size of the...

This paper considers a simple equilibrium model of an imperfectly competitive two-sided matching market. Firms and workers may have heterogeneous preferences over matches on the other side, and the model allows for both uniform and personalized wages or contracts. To make the model tractable, I...

We consider a non-cooperative multilateral bargaining game and study an action-dependent bargaining protocol, that is, the probability with which a player becomes the proposer in a round of bargaining depends on the identity of the player who previously rejected. An important example is the...

We develop a Bayes–Nash analysis of the generalized second-price (GSP) auction, the multi-unit auction used by search engines to sell sponsored advertising positions. Our main result characterizes the efficient Bayes–Nash equilibrium of the GSP and provides a necessary and sufficient...

First via a counter example it is shown that Proposition 3 of Anbarci and Sun (2013) is false. Then a gap and a mistake in their proof are identified. Finally, a modified version of their Proposition 3 is stated and proved.

Most real-life bargaining is resolved gradually. During this process parties reach intermediate agreements. These intermediate agreements serve as disagreement points in subsequent rounds. We identify robustness criteria which are satisfied by three prominent bargaining solutions, the Nash,...

We study desirability axioms imposed on allocations in indivisible object allocation problems. The existing axioms in the literature are various conditions of robustness to blocking coalitions with respect to agentsʼ ex ante (individual rationality and group rationality) and ex post (Pareto...