arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.5946cs.GTcs.DS
收藏

最佳Groupon分配

Optimal Groupon Allocations

Weihao Kong, Jian Li, Tao Qin, Tie-Yan Liu

摘要:

以Groupon.com为代表的团购网站在当今电子商务和网上购物中非常流行。他们有多个插槽,每天为他们的访客提供显著折扣。当前的用户流量分配主要依赖于人的决策。本文研究了如何将团购网站的用户流量自动分配到不同的交易中以使总收益最大化的问题,称之为团购分配问题(\GAP)。\GAP \的关键挑战是如何处理每笔交易的临界点(下限)和购买限额(上限)。我们制定\GAP \作为一个背包样的问题,可变大小的项目和优化约束。我们对\GAP \的主要结果可以总结如下。(1)我们首先表明,对于一个特殊的情况下,\GAP,其中的下限等于上限为每笔交易,有一个简单的动态规划为基础的算法,可以找到一个最佳的分配在伪多项式时间。(2)\GAP \的一般情况比特殊情况困难得多。为了解决这个问题,我们首先发现了最优分配的几个结构属性,然后设计了一个基于两层动态规划的算法,利用这些属性。该算法可以在伪多项式时间内找到最优分配。(3)我们转换的两层动态规划为基础的算法,一个完全多项式时间近似计划(FPTAS),使用\cite{ibarra1975fast}中开发的技术,结合一些仔细修改的动态程序。除了这些结果,我们进一步研究了\GAP的一些自然推广,并提出了有效的算法。

英文摘要:

Group-buying websites represented by Groupon.com are very popular in electronic commerce and online shopping nowadays. They have multiple slots to provide deals with significant discounts to their visitors every day. The current user traffic allocation mostly relies on human decisions. We study the problem of automatically allocating the user traffic of a group-buying website to different deals to maximize the total revenue and refer to it as the Group-buying Allocation Problem (\GAP). The key challenge of \GAP\ is how to handle the tipping point (lower bound) and the purchase limit (upper bound) of each deal. We formulate \GAP\ as a knapsack-like problem with variable-sized items and majorization constraints. Our main results for \GAP\ can be summarized as follows. (1) We first show that for a special case of \GAP, in which the lower bound equals the upper bound for each deal, there is a simple dynamic programming-based algorithm that can find an optimal allocation in pseudo-polynomial time. (2) The general case of \GAP\ is much more difficult than the special case. To solve the problem, we first discover several structural properties of the optimal allocation, and then design a two-layer dynamic programming-based algorithm leveraging those properties. This algorithm can find an optimal allocation in pseudo-polynomial time. (3) We convert the two-layer dynamic programming based algorithm to a fully polynomial time approximation scheme (FPTAS), using the technique developed in \cite{ibarra1975fast}, combined with some careful modifications of the dynamic programs. Besides these results, we further investigate some natural generalizations of \GAP, and propose effective algorithms.

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

↑