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

This article characterizes the conditions under which holdout (i.e. bargaining inefficiency) may, or may not be significant in a two-sided, one-buyer-many-seller model with complementarity. Our central result is that the severity of holdout (i.e. inefficiency) is critically dependent on three...

We address the common scenario where a group of agents wants to divide a set of items fairly, and at the same time seeks to optimize a global goal. Suppose that each item is a task and we want to find an allocation that minimizes the completion time of the last task in an envy-free manner, where...

We consider full implementation in complete-information environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a...

A group of heterogeneous agents may form partnerships in pairs. All single agents as well as all partnerships generate values. If two agents choose to cooperate, they need to specify how to split their joint value among one another. In equilibrium, which may or may not exist, no agents have...

In a game of common interest there is one action vector that all players prefer to every other. Yet there may be multiple Pareto-ranked Nash equilibria in the game and the “coordination problem” refers to the fact that rational equilibrium play cannot rule out Pareto-dominated equilibria. In...

It is well known that ex post efficient mechanisms for the provision of indivisible public goods are not interim individually rational. However, the corresponding literature assumes that agents who veto a mechanism can enforce a situation in which the public good is never provided. This paper...