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

We study experimentally the effects of cost structure and prize allocation rules on the performance of rent-seeking contests. Most previous studies use a lottery prize rule and linear cost, and find both overbidding relative to the Nash equilibrium prediction and significant variation of...

We introduce three extensions of the Hirshleifer–Skaperdas conflict game to study experimentally the effects of post-conflict behavior and repeated interaction on the allocation of effort between production and appropriation. Without repeated interaction, destruction of resources by defeated...

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

Paired Kidney Exchange (PKE) programs solve incompatibility problems of donor–patient pairs in living donor kidney transplantation by arranging exchanges of donors among several pairs. Further efficiency gains may emerge if the programs consider the quality of the matches between patients and...

In dealing with peer punishment as a cooperation enforcement device, laboratory studies have typically concentrated on discretionary sanctioning, allowing players to castigate each other arbitrarily. By contrast, in real life punishments are often meted out only insofar as punishers are entitled...

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

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 offer complete characterizations of the equilibrium outcomes of two prominent agenda voting institutions that are widely used in the democratic world: the amendment, also known as the Anglo-American procedure, and the successive, or equivalently the Euro-Latin procedure. Our axiomatic...