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

带延迟与随机到达时间的在线匹配

Online matching with delays and stochastic arrival times

Mathieu Mari, Michał Pawłowski, Runtian Ren, Piotr Sankowski

AI总结:

本文研究请求按泊松过程到达的带延迟最小代价完美匹配问题,提出两个确定性在线算法,在期望意义下实现常数竞争比,并推广到一般延迟代价函数及带惩罚的变体。

摘要:

本文为最小代价带延迟完美匹配(MPMD)提出了一个新的研究方向,该问题由 Emek 等人(STOC'16)引入。在该问题的原始版本中,给定一个 n 点度量空间,请求以在线方式到达。目标是对偶数个请求最小化匹配代价。然而,与传统的在线匹配问题不同,请求不必在其到达时立即配对。相反,是否匹配一个请求的决定可以推迟时间 t,并产生延迟代价 t。因此,MPMD 的目标是最小化距离代价与延迟代价的总和。有趣的是,对于对抗性生成的请求,没有任何在线算法能够达到优于 O(log n/log log n) 的竞争比(Ashlagi 等人,APPROX/RANDOM'17)。\n\n这里,我们考虑 MPMD 问题的一个随机版本,其中输入请求遵循泊松到达过程。对于这样的问题,我们通过提出两个确定性的在线算法来证明上述下界可以被改进,这两个算法在期望意义下是常数竞争的。第一个是一个简单的贪心算法,一旦任意两个请求的延迟代价之和超过它们的连接代价(即它们之间的距离),就将它们匹配。第二个算法建立在用于分析第一个算法的工具之上,以获得更好的性能保证。这一结果相当令人惊讶,因为针对对抗模型的贪心方法所达到的竞争比为 Ω(m^{log(3/2)+ε}),其中 m 表示被服务的请求数量(Azar 等人,TOCS'20)。最后,我们证明当延迟代价遵循任意正的且非递减的函数时,以及对于带有清除待处理请求惩罚的 MPMD 变体,也有可能获得类似的结果。

英文摘要:

This paper presents a new research direction for the Min-cost Perfect Matching with Delays (MPMD) - a problem introduced by Emek et al. (STOC'16). In the original version of this problem, we are given an $n$-point metric space, where requests arrive in an online fashion. The goal is to minimise the matching cost for an even number of requests. However, contrary to traditional online matching problems, a request does not have to be paired immediately at the time of its arrival. Instead, the decision of whether to match a request can be postponed for time $t$ at a delay cost of $t$. For this reason, the goal of the MPMD is to minimise the overall sum of distance and delay costs. Interestingly, for adversarially generated requests, no online algorithm can achieve a competitive ratio better than $O(\log n/\log \log n)$ (Ashlagi et al., APPROX/RANDOM'17). Here, we consider a stochastic version of the MPMD problem where the input requests follow a Poisson arrival process. For such a problem, we show that the above lower bound can be improved by presenting two deterministic online algorithms, which, in expectation, are constant-competitive. The first one is a simple greedy algorithm that matches any two requests once the sum of their delay costs exceeds their connection cost, i.e., the distance between them. The second algorithm builds on the tools used to analyse the first one in order to obtain even better performance guarantees. This result is rather surprising as the greedy approach for the adversarial model achieves a competitive ratio of $Ω(m^{\log \frac{3}{2}+\varepsilon})$, where $m$ denotes the number of requests served (Azar et al., TOCS'20). Finally, we prove that it is possible to obtain similar results for the general case when the delay cost follows an arbitrary positive and non-decreasing function, as well as for the MPMD variant with penalties to clear pending requests.

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

↑