Davin Choo , Yan Hao Ling , Warut Suksompong , Nicholas Teh , Jian Zhang
{"title":"最低补贴下的无羡住房分配","authors":"Davin Choo , Yan Hao Ling , Warut Suksompong , Nicholas Teh , Jian Zhang","doi":"10.1016/j.orl.2024.107103","DOIUrl":null,"url":null,"abstract":"<div><p>House allocation refers to the problem where <em>m</em> houses are to be allocated to <em>n</em> agents so that each agent receives one house. Since an envy-free house allocation does not always exist, we consider finding such an allocation in the presence of subsidy. We show that computing an envy-free allocation with minimum subsidy is NP-hard in general, but can be done efficiently if <em>m</em> differs from <em>n</em> by an additive constant or if the agents have identical utilities.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637724000397/pdfft?md5=c6c307f86a7510bbca9b7b354ea2e586&pid=1-s2.0-S0167637724000397-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Envy-free house allocation with minimum subsidy\",\"authors\":\"Davin Choo , Yan Hao Ling , Warut Suksompong , Nicholas Teh , Jian Zhang\",\"doi\":\"10.1016/j.orl.2024.107103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>House allocation refers to the problem where <em>m</em> houses are to be allocated to <em>n</em> agents so that each agent receives one house. Since an envy-free house allocation does not always exist, we consider finding such an allocation in the presence of subsidy. We show that computing an envy-free allocation with minimum subsidy is NP-hard in general, but can be done efficiently if <em>m</em> differs from <em>n</em> by an additive constant or if the agents have identical utilities.</p></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-03-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0167637724000397/pdfft?md5=c6c307f86a7510bbca9b7b354ea2e586&pid=1-s2.0-S0167637724000397-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637724000397\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724000397","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
摘要
房屋分配指的是这样一个问题：将 m 所房屋分配给 n 个代理人，使每个代理人都能得到一所房屋。由于不令人嫉妒的房屋分配并不总是存在，因此我们考虑在有补贴的情况下找到这样一种分配。我们的研究表明，计算补贴最小的无妒忌分配一般来说是 NP 难的，但如果 m 与 n 相差一个加常数，或者代理人有相同的效用，则可以高效地完成计算。
House allocation refers to the problem where m houses are to be allocated to n agents so that each agent receives one house. Since an envy-free house allocation does not always exist, we consider finding such an allocation in the presence of subsidy. We show that computing an envy-free allocation with minimum subsidy is NP-hard in general, but can be done efficiently if m differs from n by an additive constant or if the agents have identical utilities.
期刊介绍：
Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
