{"title":"分配更多的学生到他们的首选:一个打破僵局的规则比较","authors":"I. Ashlagi, Afshin Nikzad, Assaf Romm","doi":"10.1145/2764468.2764540","DOIUrl":null,"url":null,"abstract":"School choice districts that implement stable matchings face various design issues that impact students' assignments to schools. We study properties of the rank distribution of students with random preferences, when schools use different tiebreaking rules to rank equivalent students. We find that under a multiple tiebreaking rule a vanishing fraction of students match to one of their top choices, in contrast to a single tiebreaking rule under which a constant fraction of students are assigned to one of their top choices. We find that when students can submit only a relatively short preference list, the multiple tiebreaking rule allows a constant fraction of students to match to one of their top choices, with only a \"small\" fraction of students remaining unmatched.","PeriodicalId":376992,"journal":{"name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison\",\"authors\":\"I. Ashlagi, Afshin Nikzad, Assaf Romm\",\"doi\":\"10.1145/2764468.2764540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"School choice districts that implement stable matchings face various design issues that impact students' assignments to schools. We study properties of the rank distribution of students with random preferences, when schools use different tiebreaking rules to rank equivalent students. We find that under a multiple tiebreaking rule a vanishing fraction of students match to one of their top choices, in contrast to a single tiebreaking rule under which a constant fraction of students are assigned to one of their top choices. We find that when students can submit only a relatively short preference list, the multiple tiebreaking rule allows a constant fraction of students to match to one of their top choices, with only a \\\"small\\\" fraction of students remaining unmatched.\",\"PeriodicalId\":376992,\"journal\":{\"name\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2764468.2764540\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2764468.2764540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison
School choice districts that implement stable matchings face various design issues that impact students' assignments to schools. We study properties of the rank distribution of students with random preferences, when schools use different tiebreaking rules to rank equivalent students. We find that under a multiple tiebreaking rule a vanishing fraction of students match to one of their top choices, in contrast to a single tiebreaking rule under which a constant fraction of students are assigned to one of their top choices. We find that when students can submit only a relatively short preference list, the multiple tiebreaking rule allows a constant fraction of students to match to one of their top choices, with only a "small" fraction of students remaining unmatched.