Showing 1 - 7 of 7
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...
Persistent link: https://www.econbiz.de/10005407544
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...
Persistent link: https://www.econbiz.de/10005407566
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,...
Persistent link: https://www.econbiz.de/10005407604
In this paper we analyze two house allocation mechanisms each of which is designed to eliminate inefficiencies in real-life house allocation problems where there are both existing tenants and newcomers. The first mechanism chooses the unique core allocation of a "sister" exchange economy which...
Persistent link: https://www.econbiz.de/10005118529
The theoretical literature on exchange of indivisible goods finds natural application in organizing the exchange of live donor kidneys for transplant. However, in kidney exchange, there are constraints on the size of feasible exchanges. Initially, kidney exchanges are likely to be pairwise...
Persistent link: https://www.econbiz.de/10005118627
This paper studies an adaptive artificial agent model using a genetic algorithm to analyze how a population of decision-makers learns to coordinate on the selection of an equilibrium or a social convention in a two-sided matching game. In the contexts of centralized and decentralized entry-level...
Persistent link: https://www.econbiz.de/10005550908
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...
Persistent link: https://www.econbiz.de/10005550942