arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1009.5037cs.GTcs.DM
收藏

回购问题--带取消费用的近似拟阵交集

Buyback Problem - Approximate matroid intersection with cancellation costs

B. V. Ashwinkumar

摘要:

在回购问题中,算法观察一系列出价,并且必须在每个出价到达的那一刻决定是否接受它,这取决于对接受的出价集合的一些约束。拒绝投标的决定是不可撤销的,而接受投标的决定可能会被取消,费用是投标价值的一个固定分数。在我们的工作之前,确定性和随机算法是已知的约束时,拟阵约束。我们扩展了这一点,并给出了一个确定性算法的情况下,当约束是一个交集的$k$拟阵约束。我们进一步证明了这个问题的竞争比的匹配下界,并将我们的结果推广到任意向下闭集系统。该问题应用于横幅广告、半流、路由、负载均衡和允许抢占或取消先前分配的其他问题。

英文摘要:

In the buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it arrives, subject to some constraints on the set of accepted bids. Decisions to reject bids are irrevocable, whereas decisions to accept bids may be canceled at a cost that is a fixed fraction of the bid value. Previous to our work, deterministic and randomized algorithms were known when the constraint is a matroid constraint. We extend this and give a deterministic algorithm for the case when the constraint is an intersection of $k$ matroid constraints. We further prove a matching lower bound on the competitive ratio for this problem and extend our results to arbitrary downward closed set systems. This problem has applications to banner advertisement, semi-streaming, routing, load balancing and other problems where preemption or cancellation of previous allocations is allowed.

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

↑