ͽÄêɽ -¾ÜºÙ¾ðÊó-
·ï̾ | LS¡¡Yajing Chen»á |
³«»ÏÆü»þ | 2011ǯ 12·î 20Æü (²ÐÍËÆü) 12»þ15ʬ (GMT+09:00) |
½ªÎ»Æü»þ | 2011ǯ 12·î 20Æü (²ÐÍËÆü) 12»þ50ʬ (GMT+09:00) |
¾ì½ê | 1¹æ´Û401¶µ¼¼ |
¾ÜºÙ | GLOPE II ¥é¥ó¥Á¥¿¥¤¥à¥»¥ß¥Ê¡¼ ¡ÚÊó¹ð¼Ô¡ÛYajing Chen¡ÊWaseda University¡Ë ¡Ú¥¿¥¤¥È¥ë¡ÛStrategy-proof Boston Mechanism ¡Ú¾ì½ê¡Û1¹æ´Û401¶µ¼¼ ¡Ú³µÍ×¡Û The Boston mechanism is a widespread student placement mechanism around the world. However, it is neither strategy-proof nor stable. Our first result shows that the Boston mechanism is strategy-proof if and only if the priority structure is mutually independent. Moreover, if we assume acceptant priority structure, then the Boston mechanism is strategy-proof if and only if the number of total seats at any two schools exceeds the number of students. Our second result shows that the Boston mechanism is stable if and only if the priority structure is regret-free. *The talk will be given in English. |
¥«¥Æ¥´¥ê¡¼ | À¯¼£·ÐºÑ³Ø´ðÁÃ¥»¥ß¥Ê¡¼¡¦¥é¥ó¥Á¥¿¥¤¥à¥»¥ß¥Ê¡¼ |