KIID下的在线匹配:通过常微分方程系统增强的竞争分析
Online Matching under KIID: Enhanced Competitive Analysis through Ordinary Differential Equation Systems
AI总结:
针对KIID下的顶点加权在线匹配问题,提出元算法RTB,通过基于ODE系统的新分析方法,结合定制依赖舍入向量实现0.7341的竞争比,优于现有最优结果。
摘要:
我们研究具有整数到达率的已知同分布独立分布(KIID)下的(离线)顶点加权在线匹配问题。我们提出了一种元算法,记为$\boldsymbol{\textsf{RTB}}$,其核心思想为实时提升(Real-Time Boosting)。考虑二分图$G=(I,J,E)$,其中$I$和$J$分别代表离线节点集和在线节点集。令$\boldsymbol{\text{x}}=(x_{ij}) \boldsymbol{\text{∈}} [0,1]^{|E|}$,其中对于边$(i,j) \boldsymbol{\text{∈}} E$,$x_{ij}$表示该边在离线最优策略(又称全知最优策略)中被匹配的概率,该概率通常通过求解基准线性规划(LP)得到。当在线节点$j$在某个时刻$t \boldsymbol{\text{∈}} [0,1]$到达时,$\textsf{RTB}$以$x_{ij}/\boldsymbol{\text{Σ}}_{i' \boldsymbol{\text{∈}} I_{j,t}} x_{i'j}$的概率采样一个安全(可用)邻居$i \boldsymbol{\text{∈}} I_{j,t}$并将其与$j$匹配,其中$I_{j,t}$表示$j$的安全离线邻居集合。\n在本文中,我们通过证明当输入为$\boldsymbol{\text{X}}^*$时,$\textsf{RTB}$可达到$(2e^4 - 8e^2 + 21e - 27) / (2e^4) \thickapprox 0.7341$的竞争比,展示了实时提升的效力,其中$\boldsymbol{\text{X}}^* \boldsymbol{\text{∈}} \{0,1/3,2/3\}^{|E|}$是通过应用Brubach等人(Algorithmica, 2020)提出的定制依赖舍入技术得到的随机向量。我们的结果优于Brubach等人(Algorithmica, 2020)提出的0.7299以及Jaillet和Lu(Mathematics of Operations Research, 2013)提出的0.725的当前最优比率。值得注意的是,这一提升并非源于算法本身,而是来自一种新的竞争分析方法:我们引入了基于常微分方程(ODE)系统的方法,可对$\textsf{RTB}$进行整体分析。我们预计,利用来自更先进舍入技术的其他结构良好的向量,有可能进一步提升竞争力。
英文摘要:
We consider the (offline) vertex-weighted Online Matching problem under Known Identical and Independent Distributions (KIID) with integral arrival rates. We propose a meta-algorithm, denoted as $\mathsf{RTB}$, featuring Real-Time Boosting, where the core idea is as follows. Consider a bipartite graph $G=(I,J,E)$, where $I$ and $J$ represent the sets of offline and online nodes, respectively. Let $\mathbf{x}=(x_{ij}) \in [0,1]^{|E|}$, where $x_{ij}$ for $(i,j) \in E$ represents the probability that edge $(i,j)$ is matched in an offline optimal policy (a.k.a. a clairvoyant optimal policy), typically obtained by solving a benchmark linear program (LP). Upon the arrival of an online node $j$ at some time $t \in [0,1]$, $\mathsf{RTB}$ samples a safe (available) neighbor $i \in I_{j,t}$ with probability $x_{ij}/\sum_{i' \in I_{j,t}} x_{i'j}$ and matches it to $j$, where $I_{j,t}$ denotes the set of safe offline neighbors of $j$. In this paper, we showcase the power of Real-Time Boosting by demonstrating that $\mathsf{RTB}$, when fed with $\mathbf{X}^*$, achieves a competitive ratio of $(2e^4 - 8e^2 + 21e - 27) / (2e^4) \approx 0.7341$, where $\mathbf{X}^* \in \{0,1/3,2/3\}^{|E|}$ is a random vector obtained by applying a customized dependent rounding technique due to Brubach et al. (Algorithmica, 2020). Our result improves upon the state-of-the-art ratios of 0.7299 by Brubach et al. (Algorithmica, 2020) and 0.725 by Jaillet and Lu (Mathematics of Operations Research, 2013). Notably, this improvement does not stem from the algorithm itself but from a new competitive analysis methodology: We introduce an Ordinary Differential Equation (ODE) system-based approach that enables a {holistic} analysis of $\mathsf{RTB}$. We anticipate that utilizing other well-structured vectors from more advanced rounding techniques could potentially yield further improvements in the competitiveness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。