Mechanism Design for Extending the Accessibility of Facilities

Hau Chan, Jianan Lin, Chenhao Wang, Yanxi Xie
{"title":"Mechanism Design for Extending the Accessibility of Facilities","authors":"Hau Chan, Jianan Lin, Chenhao Wang, Yanxi Xie","doi":"arxiv-2409.08993","DOIUrl":null,"url":null,"abstract":"We study a variation of facility location problems (FLPs) that aims to\nimprove the accessibility of agents to the facility within the context of\nmechanism design without money. In such a variation, agents have preferences on\nthe ideal locations of the facility on a real line, and the facility's location\nis fixed in advance where (re)locating the facility is not possible due to\nvarious constraints (e.g., limited space and construction costs). To improve\nthe accessibility of agents to facilities, existing mechanism design literature\nin FLPs has proposed to structurally modify the real line (e.g., by adding a\nnew interval) or provide shuttle services between two points when structural\nmodifications are not possible. In this paper, we focus on the latter approach\nand propose to construct an accessibility range to extend the accessibility of\nthe facility. In the range, agents can receive accommodations (e.g., school\nbuses, campus shuttles, or pickup services) to help reach the facility.\nTherefore, the cost of each agent is the distance from their ideal location to\nthe facility (possibility) through the range. We focus on designing\nstrategyproof mechanisms that elicit true ideal locations from the agents and\nconstruct accessibility ranges (intervals) to approximately minimize the social\ncost or the maximum cost of agents. For both social and maximum costs, we\ndesign group strategyproof mechanisms with asymptotically tight bounds on the\napproximation ratios.","PeriodicalId":501316,"journal":{"name":"arXiv - CS - Computer Science and Game Theory","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computer Science and Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08993","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We study a variation of facility location problems (FLPs) that aims to improve the accessibility of agents to the facility within the context of mechanism design without money. In such a variation, agents have preferences on the ideal locations of the facility on a real line, and the facility's location is fixed in advance where (re)locating the facility is not possible due to various constraints (e.g., limited space and construction costs). To improve the accessibility of agents to facilities, existing mechanism design literature in FLPs has proposed to structurally modify the real line (e.g., by adding a new interval) or provide shuttle services between two points when structural modifications are not possible. In this paper, we focus on the latter approach and propose to construct an accessibility range to extend the accessibility of the facility. In the range, agents can receive accommodations (e.g., school buses, campus shuttles, or pickup services) to help reach the facility. Therefore, the cost of each agent is the distance from their ideal location to the facility (possibility) through the range. We focus on designing strategyproof mechanisms that elicit true ideal locations from the agents and construct accessibility ranges (intervals) to approximately minimize the social cost or the maximum cost of agents. For both social and maximum costs, we design group strategyproof mechanisms with asymptotically tight bounds on the approximation ratios.
扩大无障碍设施的机制设计
我们研究的是设施位置问题(FLPs)的一种变体,其目的是在无资金的机制设计背景下,改善代理访问设施的便利性。在这种变体中,代理人对实际线路上设施的理想位置有偏好,而设施的位置是事先固定的,由于各种限制(如有限的空间和建筑成本),(重新)定位设施是不可能的。为了提高代理访问设施的便利性,FLPs 中现有的机制设计文献建议对实线进行结构性修改(如增加一个新区间),或在无法进行结构性修改时在两点之间提供穿梭服务。在本文中,我们将重点放在后一种方法上,并建议构建一个无障碍范围来扩展设施的无障碍程度。因此,每个代理的成本就是其理想位置到设施(可能性)之间的距离。我们的重点是设计策略防范机制,从代理人那里获得真正的理想位置,并构建可达性范围(区间),以近似最小化代理人的社会成本或最大成本。对于社会成本和最大成本,我们设计的分组策略防范机制在近似比率上都有渐近的严格约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信