Publications
Detailed Information
Upper-contour strategy-proofness in the random assignment problem
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Advisor
- 전영섭
- Major
- 사회과학대학 경제학부
- Issue Date
- 2018-02
- Publisher
- 서울대학교 대학원
- Keywords
- Random assignment
- Description
- 학위논문 (석사)-- 서울대학교 대학원 : 사회과학대학 경제학부, 2018. 2. 전영섭.
- Abstract
- Bogomolnaia and Moulin (2001) showed that the mechanism that satisfies sd-efficiency and equal treatment of equals cannot be sd-strategy-proof. Also, Mennle and Seuken (2017) showed a decomposition result of strategy-proofness and presented partial strategy-proofness, which is a weak notion of strategy-proofness used by Mennle and Seuken's paper. In this paper, we show other strategy-proofness notion under the random assignment problem. In this paper, we present a weakened notion of strategy-proofness which is related to the upper-contour set, upper-contour strategy-proofness. Our main result is
even though sd-strategy-proofness is weakened to upper-contour strategy-proofness, we end up with impossibility results.
- Language
- English
- Files in This Item:
- Appears in Collections:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.