Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary, Alexander Vicker, Anders Yeo
{"title":"加快延期验收","authors":"Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary, Alexander Vicker, Anders Yeo","doi":"arxiv-2409.06865","DOIUrl":null,"url":null,"abstract":"A run of the deferred acceptance (DA) algorithm may contain proposals that\nare sure to be rejected. We introduce the accelerated deferred acceptance\nalgorithm that proceeds in a similar manner to DA but with sure-to-be rejected\nproposals ruled out. Accelerated deferred acceptance outputs the same stable\nmatching as DA but does so more efficiently: it terminates in weakly fewer\nrounds, requires weakly fewer proposals, and final pairs match no later.\nComputational experiments show that these efficiency savings can be strict.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"96 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Speeding up deferred acceptance\",\"authors\":\"Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary, Alexander Vicker, Anders Yeo\",\"doi\":\"arxiv-2409.06865\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A run of the deferred acceptance (DA) algorithm may contain proposals that\\nare sure to be rejected. We introduce the accelerated deferred acceptance\\nalgorithm that proceeds in a similar manner to DA but with sure-to-be rejected\\nproposals ruled out. Accelerated deferred acceptance outputs the same stable\\nmatching as DA but does so more efficiently: it terminates in weakly fewer\\nrounds, requires weakly fewer proposals, and final pairs match no later.\\nComputational experiments show that these efficiency savings can be strict.\",\"PeriodicalId\":501188,\"journal\":{\"name\":\"arXiv - ECON - Theoretical Economics\",\"volume\":\"96 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - ECON - Theoretical Economics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.06865\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - ECON - Theoretical Economics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
延迟接受(DA)算法的运行可能包含一些肯定会被拒绝的建议。我们引入了加速延迟接受算法,它的运行方式与 DA 算法类似,但排除了肯定会被拒绝的提议。加速延迟接受算法能输出与 DA 算法相同的稳定匹配结果,但效率更高:它能在极少数回合内终止,所需的提议数量也极少,而且最终配对匹配的时间不会晚于 DA 算法。
A run of the deferred acceptance (DA) algorithm may contain proposals that
are sure to be rejected. We introduce the accelerated deferred acceptance
algorithm that proceeds in a similar manner to DA but with sure-to-be rejected
proposals ruled out. Accelerated deferred acceptance outputs the same stable
matching as DA but does so more efficiently: it terminates in weakly fewer
rounds, requires weakly fewer proposals, and final pairs match no later.
Computational experiments show that these efficiency savings can be strict.