{"title":"On truthful constrained heterogeneous facility location with max-variant cost","authors":"Mohammad Lotfi , Alexandros A. Voudouris","doi":"10.1016/j.orl.2023.107060","DOIUrl":null,"url":null,"abstract":"<div><p>We consider a problem where agents have private positions on a line, and public approval preferences over two facilities, and their cost is the maximum distance from their approved facilities. The goal is to decide the facility locations to minimize the total and the max cost, while incentivizing the agents to be truthful. We design a strategyproof mechanism that is simultaneously 11- and 5-approximate for these two objective functions, thus improving the previously best-known bounds of <span><math><mn>2</mn><mi>n</mi><mo>+</mo><mn>1</mn></math></span> and 9.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"52 ","pages":"Article 107060"},"PeriodicalIF":0.8000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637723002018/pdfft?md5=533c0ef6846afe12cb9dce906c7c37bb&pid=1-s2.0-S0167637723002018-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637723002018","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
We consider a problem where agents have private positions on a line, and public approval preferences over two facilities, and their cost is the maximum distance from their approved facilities. The goal is to decide the facility locations to minimize the total and the max cost, while incentivizing the agents to be truthful. We design a strategyproof mechanism that is simultaneously 11- and 5-approximate for these two objective functions, thus improving the previously best-known bounds of and 9.
期刊介绍：
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
分享
求助内容：
应助结果提醒方式：
扫码关注我们
