查询定价的收入最大化
Revenue Maximization for Query Pricing
摘要:
在过去的几年里,在线数据买卖大幅增加。已经提出了几个框架,在理论和实践中研究查询定价。这些工作中的关键指导原则是{\em无套利}的概念,其中经纪人可以为对数据集的不同查询设置不同的价格,但必须确保定价功能不会为买家提供套利机会。然而,鲜为人知的是收入最大化方面的查询定价。在本文中,我们研究的问题所面临的经纪人销售访问数据的目标是最大限度地提高她的收入。我们表明,这个问题可以制定为一个收入最大化的问题,一心一意的买家和无限的供应,其中几个近似算法是已知的。我们进行了广泛的实证评估的性能的几个定价算法的查询定价问题在现实世界中的实例。除了以前已知的近似算法,我们提出了几个新的算法,并分析他们的理论和实验。我们的实验表明,具有最佳理论界的算法不一定是经验上最好的。我们确定的算法和算法,都是快速的,也提供了一贯的良好性能时,估值是从各种分布。
英文摘要:
Buying and selling of data online has increased substantially over the last few years. Several frameworks have already been proposed that study query pricing in theory and practice. The key guiding principle in these works is the notion of {\em arbitrage-freeness} where the broker can set different prices for different queries made to the dataset, but must ensure that the pricing function does not provide the buyers with opportunities for arbitrage. However, little is known about revenue maximization aspect of query pricing. In this paper, we study the problem faced by a broker selling access to data with the goal of maximizing her revenue. We show that this problem can be formulated as a revenue maximization problem with single-minded buyers and unlimited supply, for which several approximation algorithms are known. We perform an extensive empirical evaluation of the performance of several pricing algorithms for the query pricing problem on real-world instances. In addition to previously known approximation algorithms, we propose several new heuristics and analyze them both theoretically and experimentally. Our experiments show that algorithms with the best theoretical bounds are not necessarily the best empirically. We identify algorithms and heuristics that are both fast and also provide consistently good performance when valuations are drawn from a variety of distributions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。