动作-奖励查询-承诺匹配的近似算法
Approximation Algorithms for Action-Reward Query-Commit Matching
AI总结:
本文研究了动作-奖励查询-承诺匹配问题,设计了高效的近似算法,在单侧和双侧耐心设置下分别达到约0.63和0.58的近似比,改进了顺序定价问题的现有结果。
摘要:
在不确定性下的匹配问题出现在肾交换、招聘和在线市场等应用中。决策者必须在局部探索约束下依次探索潜在匹配,同时一旦发现成功的匹配就不可撤销地承诺。查询-承诺匹配问题通过建模成功概率已知的边,并在顶点耐心(超时)约束下接受成功边来捕捉这些挑战。本文引入了动作-奖励查询-承诺匹配问题,这是查询-承诺匹配的严格推广,其中每个查询选择一个已知的动作空间中的动作,确定查询边的成功概率和奖励。如果边被查询并成功,则不可撤销地添加到匹配中,并获得相应的奖励;否则,边被永久丢弃。我们研究了该问题在二分图上的近似算法设计。该模型捕捉了一类广泛的时间匹配问题,包括Pollner等人(EC~2022)引入的顺序定价问题。在积极方面,Pollner等人设计了一个多项式时间近似算法,在单侧耐心设置下达到0.426的比率,当双侧有界耐心时降级到0.395。在本文中,我们为单侧和双侧耐心设置设计了计算高效的算法,分别达到约0.63和0.58的近似比,这些结果改进了顺序定价问题的现有结果,超越了之前的保证0.426和0.395。
英文摘要:
Matching problems under uncertainty arise in applications such as kidney exchange, hiring, and online marketplaces. A decision-maker must sequentially explore potential matches under local exploration constraints, while committing irrevocably to successful matches as they are revealed. The query-commit matching problem captures these challenges by modeling edges that succeed independently with known probabilities and must be accepted upon success, subject to vertex patience (time-out) constraints limiting the number of incident queries. In this work, we introduce the action-reward query-commit matching problem, a strict generalization of query-commit matching in which each query selects an action from a known action space, determining both the success probability and the reward of the queried edge. If an edge is queried using a chosen action and succeeds, it is irrevocably added to the matching, and the corresponding reward is obtained; otherwise, the edge is permanently discarded. We study the design of approximation algorithms for this problem on bipartite graphs. This model captures a broad class of stochastic matching problems, including the sequential pricing problem introduced by Pollner, Roghani, Saberi, and Wajc (EC~2022). On the positive side, Pollner et al. designed a polynomial-time approximation algorithm achieving a ratio of $0.426$ in the one-sided patience setting, which degrades to $0.395$ when both sides have bounded patience. In this work, we design computationally efficient algorithms for the action-reward query-commit in one-sided and two-sided patience settings, achieving approximation ratios of $1-1/e \approx 0.63$ and $\frac{1}{27}\!\left(19-67/e^3\right) \approx 0.58$ respectively. These results improve the state of the art for the sequential pricing problem, surpassing the previous guarantees of $0.426$ and $0.395$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。