کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
957498 928530 2006 24 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Credible group stability in many-to-many matching problems
موضوعات مرتبط
علوم انسانی و اجتماعی اقتصاد، اقتصادسنجی و امور مالی اقتصاد و اقتصادسنجی
پیش نمایش صفحه اول مقاله
Credible group stability in many-to-many matching problems
چکیده انگلیسی

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 responsive preferences and the other side has categorywise-responsive preferences. A credibly group-stable matching is immune to any “executable” group deviations with an appropriate definition of executability. Under the same preference restriction, we also show the equivalence between the set of pairwise-stable matchings and the set of matchings generated by coalition-proof Nash equilibria of an appropriately defined strategic-form game.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Economic Theory - Volume 129, Issue 1, July 2006, Pages 57–80
نویسندگان
, ,