arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0908.0043cs.GT
收藏

回购问题的随机在线算法

Randomized Online Algorithms for the Buyback Problem

Ashwinkumar B. V., Robert Kleinberg

摘要:

在拟阵回购问题中,算法观察一系列出价,并且必须在每个出价到达的时刻决定是否接受每个出价,这取决于对接受的出价集合的拟阵约束。拒绝投标的决定是不可撤销的,而接受投标的决定可以取消,费用是投标价值的一个固定分数。我们提出了一个新的随机算法,这个问题,我们证明了匹配的上限和下限,建立该算法的竞争比,对一个不经意的对手,是最好的可能。我们还观察到,当对手是自适应的,没有随机算法可以提高最佳确定性算法的竞争比。因此,我们的工作完全解决的问题,什么样的竞争比可以实现的随机算法的拟阵回购问题。

英文摘要:

In the matroid buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it arrives, subject to a matroid constraint on the set of accepted bids. Decisions to reject bids are irrevocable, whereas decisions to accept bids may be canceled at a cost which is a fixed fraction of the bid value. We present a new randomized algorithm for this problem, and we prove matching upper and lower bounds to establish that the competitive ratio of this algorithm, against an oblivious adversary, is the best possible. We also observe that when the adversary is adaptive, no randomized algorithm can improve the competitive ratio of the optimal deterministic algorithm. Thus, our work completely resolves the question of what competitive ratios can be achieved by randomized algorithms for the matroid buyback problem.

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

↑