arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.23328cs.DS
收藏

医院-住院医师问题的广义容量规划

Generalized Capacity Planning for the Hospital-Residents Problem

Haricharan Balasundaram, Girija Limaye, Meghana Nasre, Abhinav Raja

AI总结:

针对医院-住院医师问题,提出广义容量规划,允许配额超配成本控制,证明局部目标可多项式求解而全局目标NP难,并给出近似算法与匹配下界。

摘要:

医院-住院医师设置模拟了重要问题,如学校选择、本科生学位项目分配等。在此设置中,项目关联有固定配额,限制了可分配至其的智能体数量。受所有智能体必须被匹配的场景启发,我们提出并研究了一个广义容量规划问题,该问题允许相对于配额的成本控制灵活性。我们的设置是医院-住院医师设置的扩展,其中项目既有通常的配额,也有相关成本,表示匹配超出初始配额的智能体的成本。我们寻求计算一个匹配,该匹配匹配所有智能体,并相对于偏好是最优的,且最小化成本的局部或全局目标。我们展示了鲜明对比——最小化局部目标可在多项式时间内解决,而最小化全局目标是NP难的。在积极方面,我们针对一般情况和特定困难情况提出了全局目标的近似算法。我们通过基于线性规划的算法实现了特定困难情况的近似保证。我们通过展示与算法结果匹配的下界来加强NP难度结果。

英文摘要:

The Hospital Residents setting models important problems like school choice, assignment of undergraduate students to degree programs, among many others. In this setting, fixed quotas are associated with the programs that limit the number of agents that can be assigned to them. Motivated by scenarios where all agents must be matched, we propose and study a generalized capacity planning problem, which allows cost-controlled flexibility with respect to quotas. Our setting is an extension of the Hospital Resident setting where programs have the usual quota as well as an associated cost, indicating the cost of matching an agent beyond the initial quotas. We seek to compute a matching that matches all agents and is optimal with respect to preferences, and minimizes either a local or a global objective on cost. We show that there is a sharp contrast -- minimizing the local objective is polynomial-time solvable, whereas minimizing the global objective is NP-hard. On the positive side, we present approximation algorithms for the global objective in the general case and a particular hard case. We achieve the approximation guarantee for the special hard case via a linear programming based algorithm. We strengthen the NP-hardness by showing a matching lower bound to our algorithmic result.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑