Publications
Detailed Information
A random assignment of indivisible goods in single-peaked economies with a common peak
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 전영섭 | - |
dc.contributor.author | 장희인 | - |
dc.date.accessioned | 2017-07-19T12:40:16Z | - |
dc.date.available | 2017-07-19T12:40:16Z | - |
dc.date.issued | 2016-08 | - |
dc.identifier.other | 000000137196 | - |
dc.identifier.uri | https://hdl.handle.net/10371/134720 | - |
dc.description | 학위논문 (석사)-- 서울대학교 대학원 : 경제학부 경제학전공, 2016. 8. 전영섭. | - |
dc.description.abstract | Bogomolnaia and Moulin (2001) show that there is no rule satisfying equal treatment of equals, sd-efficiency and sd-strategyproofness for a random assignment problem of indivisible goods. Furthermore, Kasajima (2013) shows that the incompatibility result holds when agents have single-peaked preferences. In this paper, we restrict the domain by requiring that all agents have a common peak and investigate the existence of rules satisfying the three axioms. We show that the three axioms are still incompatible. As it turns out, the three axioms are still incompatible even though all agents have the same preferences except the three least-preferable objects. | - |
dc.description.tableofcontents | 1. Introduction 1
2. Model 3 3. Results 6 4. Conclusion 13 Appendix : A formal proof for odd n 14 References 21 | - |
dc.format | application/pdf | - |
dc.format.extent | 398616 bytes | - |
dc.format.medium | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | 서울대학교 대학원 | - |
dc.subject | Probabilistic assignment | - |
dc.subject | indivisible goods | - |
dc.subject | impossibility result | - |
dc.subject.ddc | 330 | - |
dc.title | A random assignment of indivisible goods in single-peaked economies with a common peak | - |
dc.type | Thesis | - |
dc.description.degree | Master | - |
dc.citation.pages | 21 | - |
dc.contributor.affiliation | 사회과학대학 경제학부 | - |
dc.date.awarded | 2016-08 | - |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.