arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.14717cs.DS
收藏

广义随机匹配

Generalized Stochastic Matching

Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi

摘要:

在本文中,我们概括了最近研究的随机匹配问题,更准确地模拟一个重要的医疗过程,肾脏交换,和其他几个应用程序。目前研究的随机匹配问题是:给定一个图G =(V,E),G的每条边以概率p_e相互独立地包含在G的已实现子图中,目标是找到G的度有界子图Q,Q的期望最大匹配近似于已实现子图的期望最大匹配。该模型没有考虑顶点脱落的可能性,这可以在几个应用中找到,例如在肾脏交换中,当捐赠者或患者选择退出交换过程时,以及在在线自由职业者和在线约会中,当发现在线个人资料是伪造的时。因此,我们将研究一个更一般化的随机匹配模型,其中顶点和边都分别以一定的概率p_v,p_e独立实现,这比以前研究的模型更准确地适合重要的应用。我们将讨论第一个算法和分析,这种推广的随机匹配模型,并证明他们实现良好的近似比。特别是,我们证明了这个问题的自然算法的近似因子至少是$0.6568$在未加权图,和$1/2 + ε$在加权图的一些常数$ε> 0$。利用边度约束子图(EDCS),我们进一步改进了无权图的结果为$2/3$。

英文摘要:

In this paper, we generalize the recently studied Stochastic Matching problem to more accurately model a significant medical process, kidney exchange, and several other applications. Up until now the Stochastic Matching problem that has been studied was as follows: given a graph G = (V, E), each edge is included in the realized sub-graph of G mutually independently with probability p_e, and the goal is to find a degree-bounded sub-graph Q of G that has an expected maximum matching that approximates the expected maximum matching of the realized sub-graph. This model does not account for possibilities of vertex dropouts, which can be found in several applications, e.g. in kidney exchange when donors or patients opt out of the exchange process as well as in online freelancing and online dating when online profiles are found to be faked. Thus, we will study a more generalized model of Stochastic Matching in which vertices and edges are both realized independently with some probabilities p_v, p_e, respectively, which more accurately fits important applications than the previously studied model. We will discuss the first algorithms and analysis for this generalization of the Stochastic Matching model and prove that they achieve good approximation ratios. In particular, we show that the approximation factor of a natural algorithm for this problem is at least $0.6568$ in unweighted graphs, and $1/2 + ε$ in weighted graphs for some constant $ε> 0$. We further improve our result for unweighted graphs to $2/3$ using edge degree constrained subgraphs (EDCS).

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

↑