システム情報系　社会工学域

　　平成２８年度　　　　ファカルティ・セミナー

　　　　　　　　　　　　　　　（Faculty Seminar）

日　時　　　：　平成２８年１２月１日（木）         １６：３０〜１７：１５

場　所　　　：　３C３０６

司会者　　　：　栗野　盛光

講　演　者　：　石田　航　氏（横浜国立大学経済学部）

演　題　　　：　How to find a stable and efficient matching: top trading cycle mechanism
                 　　　under weak priorities

　　　　　　　　　　　　　　　　　　＜ abstract ＞

We consider priority-based allocation problems under weak priorities. In reality, weak priorities are often observed, but it is unknown how to achieve a stable and efficient matching. Although Ehlers and Erdil (2010) found the condition for priorities that guarantees a stable and efficient matching, it is impossible to achieve it via any strategy-proof mechanisms (Erdil and Ergin (2008)). This paper introduces the top trading cycle mechanism for weak priorities, and identifies the condition for priorities that guarantees a stable and efficient matching. It is surprising that one condition does not imply the other.