从邻近到效用:帕累托最优的Voronoi划分
From Proximity to Utility: A Voronoi Partition of Pareto Optima
摘要:
我们提出了一个扩展的沃罗诺伊图在考虑客户端将使用哪个网站时,除了网站的距离,其他网站的属性也被考虑(例如,价格或重量)。图中的一个单元格是所有认为同一组站点相关的客户端的所在地。具体地说,客户端可能使用的候选集合中的精确站点取决于可能在使用之间改变的参数,并且候选集合列出了所有相关站点。所得到的图比沃罗诺伊图明显更有表现力,但自然地具有其复杂性的缺点,即使在平面上,也可能相当高。然而,我们表明,如果站点的属性是从相同的分布(注意,位置是固定的),那么候选图的预期复杂性是接近线性的。为此,我们得到了几个新的技术成果,这是独立的利益。特别是,我们提供了一个高概率的,渐近最优的约束上的帕累托最优点的数量在一个点集均匀采样的$d$维超立方体。要做到这一点,我们重温经典的向后分析技术,简化和改进相关结果,以实现高概率界。
英文摘要:
We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is then the locus of all clients that consider the same set of sites to be relevant. In particular, the precise site a client might use from this candidate set depends on parameters that might change between usages, and the candidate set lists all of the relevant sites. The resulting diagram is significantly more expressive than Voronoi diagrams, but naturally has the drawback that its complexity, even in the plane, might be quite high. Nevertheless, we show that if the attributes of the sites are drawn from the same distribution (note that the locations are fixed), then the expected complexity of the candidate diagram is near linear. To this end, we derive several new technical results, which are of independent interest. In particular, we provide a high-probability, asymptotically optimal bound on the number of Pareto optima points in a point set uniformly sampled from the $d$-dimensional hypercube. To do so we revisit the classical backward analysis technique, both simplifying and improving relevant results in order to achieve the high-probability bounds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。