{"title":"择校问题的顶层交易循环机制表征","authors":"Umut Dur, Scott Paiement","doi":"10.1016/j.mathsocsci.2024.03.006","DOIUrl":null,"url":null,"abstract":"<div><p>This paper characterizes the Top Trading Cycles (TTC) mechanism for the school choice problem where schools may have multiple available seats to be assigned to students. We first define weaker forms of fairness, consistency, and resource monotonicity. We show that the TTC mechanism is the unique Pareto efficient and strategy-proof mechanism that satisfies these weaker forms of fairness, consistency and resource monotonicity. We also show that in a well-defined sense TTC is the “most stable” Pareto efficient mechanism.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 93-100"},"PeriodicalIF":0.5000,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A characterization of the top trading cycles mechanism for the school choice problem\",\"authors\":\"Umut Dur, Scott Paiement\",\"doi\":\"10.1016/j.mathsocsci.2024.03.006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper characterizes the Top Trading Cycles (TTC) mechanism for the school choice problem where schools may have multiple available seats to be assigned to students. We first define weaker forms of fairness, consistency, and resource monotonicity. We show that the TTC mechanism is the unique Pareto efficient and strategy-proof mechanism that satisfies these weaker forms of fairness, consistency and resource monotonicity. We also show that in a well-defined sense TTC is the “most stable” Pareto efficient mechanism.</p></div>\",\"PeriodicalId\":51118,\"journal\":{\"name\":\"Mathematical Social Sciences\",\"volume\":\"129 \",\"pages\":\"Pages 93-100\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Social Sciences\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0165489624000374\",\"RegionNum\":4,\"RegionCategory\":\"经济学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Social Sciences","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0165489624000374","RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
A characterization of the top trading cycles mechanism for the school choice problem
This paper characterizes the Top Trading Cycles (TTC) mechanism for the school choice problem where schools may have multiple available seats to be assigned to students. We first define weaker forms of fairness, consistency, and resource monotonicity. We show that the TTC mechanism is the unique Pareto efficient and strategy-proof mechanism that satisfies these weaker forms of fairness, consistency and resource monotonicity. We also show that in a well-defined sense TTC is the “most stable” Pareto efficient mechanism.
期刊介绍:
The international, interdisciplinary journal Mathematical Social Sciences publishes original research articles, survey papers, short notes and book reviews. The journal emphasizes the unity of mathematical modelling in economics, psychology, political sciences, sociology and other social sciences.
Topics of particular interest include the fundamental aspects of choice, information, and preferences (decision science) and of interaction (game theory and economic theory), the measurement of utility, welfare and inequality, the formal theories of justice and implementation, voting rules, cooperative games, fair division, cost allocation, bargaining, matching, social networks, and evolutionary and other dynamics models.
Papers published by the journal are mathematically rigorous but no bounds, from above or from below, limits their technical level. All mathematical techniques may be used. The articles should be self-contained and readable by social scientists trained in mathematics.