کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
957431 | 928526 | 2010 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The roommates problem revisited
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
علوم انسانی و اجتماعی
اقتصاد، اقتصادسنجی و امور مالی
اقتصاد و اقتصادسنجی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
One of the oldest matching problems is Gale and Shapley's (1962) [8] “roommates problem”: is there a stable way to assign 2N students into N roommate pairs? Unlike the classic marriage problem or college admissions problem, there need not exist a stable solution to the roommates problem. However, stability ignores the key physical constraint that roommates require a room and is therefore too restrictive. This motivates a new matching problem: matching agents subject to an initial assignment. A particularly important example is kidney exchange where after an assignment has been made, subsequent tests may determine that a patient and donor are incompatible. This paper introduces an efficient algorithm for finding a Pareto improvement starting from any status quo roommates assignment.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Economic Theory - Volume 145, Issue 5, September 2010, Pages 1739-1756
Journal: Journal of Economic Theory - Volume 145, Issue 5, September 2010, Pages 1739-1756
نویسندگان
Thayer Morrill,