For an incompatible patient-donor pair, kidney exchanges often forbid receipt-before-donation (the patient receives a kidney before the donor donates) and donation-before-receipt, causing a double-coincidence-of-wants problem. Our proposal, the Unpaired kidney exchange algorithm, uses...

We consider a hybrid model at the intersection of the standard two-sided matching market as proposed by Gale and Shapley (1962) and a housing market as proposed by Shapley and Scarf (1974). Two sets of agents have to be matched in pairs to a common set of objects. Agents of one type have...

We study a large market model of dynamic matching with no monetary transfers and a continuum of agents. Time is discrete and horizon finite. Agents are in the market from the first date and, at each date, have to be assigned items (or bundles of items). When the social planner can only elicit...

We consider a reallocation problem with priorities where each agent is initially endowed with a house and is willing to exchange it but each house has a priority ordering over the agents of the market. In this setting, it is well known that there is no individually rational and stable mechanism....

For an incompatible patient-donor pair, kidney exchanges often forbid receipt-before-donation (the patient receives a kidney before the donor donates) and donation-before-receipt, causing a double-coincidence-of-wants problem. Our proposed algorithm, the Unpaired kidney exchange algorithm, uses...