{"title":"择校能力设计","authors":"U. Dur, Martin Van der Linden","doi":"10.2139/ssrn.3898719","DOIUrl":null,"url":null,"abstract":"We study a new variant of the school choice problem in which capacities can be altered by distributing additional seats across schools in response to students’ reported preferences. We show that heuristics solutions to this capacity design problem can be inefficient, even if they focus on allocating seats to the most demanded schools. However, we introduce a simple myopic algorithm that characterizes the set of efficient matchings among those that respect priorities.","PeriodicalId":414766,"journal":{"name":"DecisionSciRN: Heuristics (Sub-Topic)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Capacity Design in School Choice\",\"authors\":\"U. Dur, Martin Van der Linden\",\"doi\":\"10.2139/ssrn.3898719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study a new variant of the school choice problem in which capacities can be altered by distributing additional seats across schools in response to students’ reported preferences. We show that heuristics solutions to this capacity design problem can be inefficient, even if they focus on allocating seats to the most demanded schools. However, we introduce a simple myopic algorithm that characterizes the set of efficient matchings among those that respect priorities.\",\"PeriodicalId\":414766,\"journal\":{\"name\":\"DecisionSciRN: Heuristics (Sub-Topic)\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DecisionSciRN: Heuristics (Sub-Topic)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3898719\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DecisionSciRN: Heuristics (Sub-Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3898719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study a new variant of the school choice problem in which capacities can be altered by distributing additional seats across schools in response to students’ reported preferences. We show that heuristics solutions to this capacity design problem can be inefficient, even if they focus on allocating seats to the most demanded schools. However, we introduce a simple myopic algorithm that characterizes the set of efficient matchings among those that respect priorities.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
