Posted Price Mechanisms for a Random Stream of Customers
Posted Price Mechanisms for a Random Stream of Customers
复制标题
针对随机客户群发布的价格机制
DOI：
10.1145/3033274.3085137
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
T. Vredeveld
中科院分区：
文献类型：
--
作者：
J. Correa;Patricio Foncea;R. Hoeksma;Tim Oosterwijk;T. Vredeveld
公布价格机制是一种广泛使用的向战略消费者销售商品的方式。尽管这些机制不是最佳的，但它们的吸引力来自于它们的简单性和容易实现。在本文中，我们研究了当客户到达一个未知的随机顺序时，公布的价格机制的性能。我们比较这些机制的预期收入的最优拍卖在两个不同的设置的预期收入。也就是说，非自适应设置，其中所有的报价发送给客户事先，和自适应设置，其中一个报价是当消费者到达。对于非自适应的情况下，我们得到一个战略，实现预期的收入至少在1-1/e的分数，最优拍卖。我们还表明，这个界限是紧的，即使客户有身份证。该项目的估值。对于自适应的情况下，我们展示了一个张贴的价格机制，实现了0.745的最佳收入的因素，当客户有i.i.d.该项目的估值。此外，我们证明了我们的结果扩展到先知不等式设置，特别是我们的结果i.i.d.随机估值解决了Hill和Kertz提出的问题。[13个国家]
Posted price mechanisms constitute a widely used way of selling items to strategic consumers. Although suboptimal, the attractiveness of these mechanisms comes from their simplicity and easy implementation. In this paper, we investigate the performance of posted price mechanisms when customers arrive in an unknown random order. We compare the expected revenue of these mechanisms to the expected revenue of the optimal auction in two different settings. Namely, the nonadaptive setting in which all offers are sent to the customers beforehand, and the adaptive setting in which an offer is made when a consumer arrives. For the nonadaptive case, we obtain a strategy achieving an expected revenue within at least a 1-1/e fraction of that of the optimal auction. We also show that this bound is tight, even if the customers have i.i.d. valuations for the item. For the adaptive case, we exhibit a posted price mechanism that achieves a factor 0.745 of the optimal revenue, when the customers have i.i.d. valuations for the item. Furthermore, we prove that our results extend to the prophet inequality setting and in particular our result for i.i.d. random valuations resolves a problem posed by Hill and Kertz. [13]
DOI：
10.1007/978-3-662-48350-3_42
发表时间：
2015-07
期刊：
ArXiv
影响因子：
--
作者：
H. Esfandiari;M. Hajiaghayi;Vahid Liaghat;M. Monemizadeh
通讯作者：
H. Esfandiari;M. Hajiaghayi;Vahid Liaghat;M. Monemizadeh