arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2504.04577math.OCcs.DM
收藏

稳定匹配问题的最小割可表示性

Minimum Cut Representability of Stable Matching Problems

Yuri Faenza, Ayoub Foussoul, Chengyue He

AI总结:

本文提出最小割可表示性框架,通过将稳定匹配问题转化为旋转有向图上的最小 s-t 割问题,给出目标函数与可行性集合的充要条件,并应用于学校选择和两阶段随机稳定匹配等问题。

摘要:

我们引入并研究了最小割可表示性,这是一个通过在旋转上的有向图上将稳定匹配问题表示为最小 s-t 割问题,来求解稳定匹配上的优化与可行性问题的框架。我们给出了目标函数和可行性集合使问题可被最小割表示的充分必要条件。特别地,我们定义了稳定匹配上函数的一阶与二阶微分的概念,并证明:粗略地说,一个问题可被最小割表示当且仅当目标函数可以仅用这些微分来表示,且可行性集合是稳定匹配格的子格。为了展示该框架的实际相关性,我们研究了一系列现实应用,包括带兄弟姐妹的学校选择问题和一个两阶段随机稳定匹配问题。我们展示了该框架如何用于帮助求解这些问题。

英文摘要:

We introduce and study Minimum Cut Representability, a framework to solve optimization and feasibility problems over stable matchings by representing them as minimum s-t cut problems on digraphs over rotations. We provide necessary and sufficient conditions on objective functions and feasibility sets for problems to be minimum cut representable. In particular, we define the concepts of first and second order differentials of a function over stable matchings and show that a problem is minimum cut representable if and only if, roughly speaking, the objective function can be expressed solely using these differentials, and the feasibility set is a sublattice of the stable matching lattice. To demonstrate the practical relevance of our framework, we study a range of real-world applications, including problems involving school choice with siblings and a two-stage stochastic stable matching problem. We show how our framework can be used to help solving these problems.

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

↑