This paper considers a decentralized process in many-to-many matching problems. We show that if agents on one side of the market have substitutable preferences and those on the other side have responsive preferences, then, from an arbitrary matching, there exists a finite path of matchings such...

Most transplanted kidneys are from cadavers, but there are also substantial numbers of transplants from live donors. Recently, there have started to be kidney exchanges involving two donor-patient pairs such that each donor cannot give a kidney to the intended recipient because of immunological...

Mechanisms that rely on course bidding are widely used at Business Schools in order to allocate seats at oversubscribed courses. Bids play two key roles under these mechanisms: Bids are used to infer student preferences and bids are used to determine who have bigger claims on course seats. We...

A group of friends consider renting a house but they shall first agree on how to allocate its rooms and share the rent. We propose an auction mechanism for room assignment-rent division problems which mimics the market mechanism. Our auction mechanism is efficient, envy-free,...

In September of 1998, the Judicial Conference of the United States abandoned as unsuccessful the attempt—the sixth since 1978—to regulate the dates at which law students are hired as clerks by Federal appellate judges. The market promptly resumed the unraveling of appointment dates that had...

It is known that in two-sided many-to-many matching problems, pairwise-stable matchings may not be immune to group deviations, unlike in many-to-one matching problems (Blair 1988). In this paper, we show that pairwise stability is equivalent to credible group stability when one side has...

Background: To expand the opportunity for paired live donor kidney transplantation, computerized matching algorithms have been designed to identify maximal sets of compatible donor/recipient pairs from a registry of incompatible pairs submitted as candidates for transplantation. Methods:...

In the current FIFA penalty shootout mechanism, a coin toss decides which team will kick first. Empirical evidence suggests that the team taking the first kick has a higher probability to win a shootout. We design sequentially fair shootout mechanisms such that in all symmetric Markov-perfect...

Many markets have “unraveled†and experienced inefficient, early, dispersed transactions, and subsequently developed institutions to delay transaction timing. It has previously proved difficult, however, to measure and identify the resulting efficiency gains. Prior to 1992, college...