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

有限供给下的图形定价

Graph Pricing with Limited Supply

Zachary Friggstad, Maryam Mahboub

摘要:

我们研究了具有顶点容量但没有传统无嫉妒约束的图定价的近似算法。具体来说,我们有一组项目$V$和一组客户$X$,其中每个客户$i \in X$都有一个预算$b_i$,并且对一组项目$S_i \subseteq V$和$|S_i| \leq 2$感兴趣。但是,每个项目的供应量有限:我们只有项目$v$的$μ_v$副本出售每个$v \in V$。我们应该为每个$v \in V$分配价格$p(v)$,并选择客户的子集$Y \subseteq X$,以便每个$i \in Y$都能负担得起其捆绑包($p(S_i) \leq b_i$),并且最多$μ_v$选择的客户在其捆绑包中对每个项目$v \in V$都有项目$v$。每个客户$i \in Y$都为他们购买的捆绑包支付$p(S_i)$:我们的目标是以最大化收入的方式做到这一点。这样的定价问题已经从无嫉妒的角度进行了研究,我们还必须确保每个$i \notin Y$的$p(S_i) \geq b_i$。然而,我们在设定价格后简单地将商品分配给客户并且不担心无嫉妒条件的版本受到的关注较少。我们的主要结果是一个8-近似的情况下,通过局部搜索和7.8096-近似的简单图与一致的顶点容量。后者是通过结合一个多交换的本地搜索算法的恒定容量和LP舍入算法更大的容量的分析。如果所有的能力是有界的一个常数$C$,我们进一步表明,多交换局部搜索算法产生一个$\left(4 \cdot \frac{2C-1}{C} + ε\right)$ -近似。我们还给出了一个$(4+ε)$ -近似在简单的图形,通过LP舍入时,所有的容量都非常大的$ε$的函数。

英文摘要:

We study approximation algorithms for graph pricing with vertex capacities yet without the traditional envy-free constraint. Specifically, we have a set of items $V$ and a set of customers $X$ where each customer $i \in X$ has a budget $b_i$ and is interested in a bundle of items $S_i \subseteq V$ with $|S_i| \leq 2$. However, there is a limited supply of each item: we only have $μ_v$ copies of item $v$ to sell for each $v \in V$. We should assign prices $p(v)$ to each $v \in V$ and chose a subset $Y \subseteq X$ of customers so that each $i \in Y$ can afford their bundle ($p(S_i) \leq b_i$) and at most $μ_v$ chosen customers have item $v$ in their bundle for each item $v \in V$. Each customer $i \in Y$ pays $p(S_i)$ for the bundle they purchased: our goal is to do this in a way that maximizes revenue. Such pricing problems have been studied from the perspective of envy-freeness where we also must ensure that $p(S_i) \geq b_i$ for each $i \notin Y$. However, the version where we simply allocate items to customers after setting prices and do not worry about the envy-free condition has received less attention. Our main result is an 8-approximation for the capacitated case via local search and a 7.8096-approximation in simple graphs with uniform vertex capacities. The latter is obtained by combing a more involved analysis of a multi-swap local search algorithm for constant capacities and an LP-rounding algorithm for larger capacities. If all capacities are bounded by a constant $C$, we further show a multi-swap local search algorithm yields an $\left(4 \cdot \frac{2C-1}{C} + ε\right)$-approximation. We also give a $(4+ε)$-approximation in simple graphs through LP rounding when all capacities are very large as a function of $ε$.

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

↑