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

We study resource allocation with multi-unit demand, such as the allocation of courses to students. In contrast to the case of single-unit demand, no stable mechanism, not even the (student-proposing) deferred acceptance algorithm, achieves desirable properties: it is not strategy-proof and the...

We propose an equilibrium model of duopolistic dynamic pricing in which a buyer alternates between two sellers for price offers over a finite time horizon. The game ends when the buyer accepts a price offer or the selling season is over, whichever comes first. Previous research (Granot et al.,...

Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested agents and consequent strategic issues, but these papers focus on...

We provide an algorithm for testing the substitutability of a length-N preference relation over a set of contracts X in time O(|X|3⋅N3). Access to the preference relation is essential for this result: We show that a substitutability-testing algorithm with access only to an agentʼs choice...

We study the length of agreements in a market in which infinitely-lived firms contract with agents that live for two periods. Firms differ in the expected values of their projects, as do workers in their abilities to manage projects. Worker effort is not contractible and worker ability is...