在线随机匹配的计算困难性
Computational Hardness of Online Stochastic Matching
Yifeng Teng, Zongjun Yang
AI 速读 基于摘要
该论文首次给出随机到达顺序下在线随机匹配问题的计算困难性结果,证明已知i.i.d.到达时求在线最优是APX-hard,随机顺序到达即使只有一个离线节点(prophet secretary情形)也是#P-hard。
cs.DS · cs.CC · cs.GT
查看原文摘要
In the online stochastic matching problem on a bipartite graph, offline vertices are given in advance, and online requests arrive sequentially from known distributions, each matched immediately and irrevocably to a free neighbor or rejected. Computational hardness results of the optimal online strategy have been known only for instances where online vertices have a fixed arrival order [Papadimitriou et al., 2024]. For random-order arrivals or even i.i.d. arrivals, it has been long open since the problem was proposed [Feldman et al., 2009]. In this paper, we give the first computational hardness results for online stochastic matching with random-order arrivals. In particular, we prove that for known i.i.d. arrivals, computing the online optimum is APX-hard, ruling out a Polynomial-Time Approximation Scheme unless P = NP, even in unweighted graphs with two offline neighbors per online vertex. For random-order arrivals, even when there is only one offline node (i.e., the prophet secretary setting), computing the optimal online policy is #P-hard, resolving an open problem since [Dütting et al., 2023].