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

有效条件下的贝叶斯拍卖

Bayesian Auctions with Efficient Queries

Jing Chen, Bo Li, Yingkai Li, Pinyan Lu

摘要:

产生好的收益是贝叶斯拍卖设计中最重要的问题之一,许多(近似)最优的主导策略激励兼容(DSIC)贝叶斯机制已被构造为各种拍卖设置。然而,现有的研究大多没有考虑卖方执行机制的复杂性。假设卖方知道分布的“每一位”,并且能够基于整个分布进行完美优化。不幸的是,这是一个很强的假设,在现实中可能不成立:例如,当值分布具有指数大的支持或没有简洁的表示时。在这项工作中,我们认为,第一次,贝叶斯机制的查询复杂性。我们只允许卖方通过分位数查询和值查询对参与者的值分布进行有限的Oracle访问。对于一个大类的拍卖设置,我们证明了对数下界的查询复杂性的任何DSIC贝叶斯机制是任何常数近似的最佳收益。对于单物品拍卖和多物品拍卖的单位需求或添加剂的价值函数,我们证明了紧的上界,通过有效的查询计划,而不需要的分布是正规的或有单调的风险率。因此,在这些拍卖设置中,卖方需要访问比全部分配少得多的分配,以实现近似最佳的收入。

英文摘要:

Generating good revenue is one of the most important problems in Bayesian auction design, and many (approximately) optimal dominant-strategy incentive compatible (DSIC) Bayesian mechanisms have been constructed for various auction settings. However, most existing studies do not consider the complexity for the seller to carry out the mechanism. It is assumed that the seller knows "each single bit" of the distributions and is able to optimize perfectly based on the entire distributions. Unfortunately, this is a strong assumption and may not hold in reality: for example, when the value distributions have exponentially large supports or do not have succinct representations. In this work we consider, for the first time, the query complexity of Bayesian mechanisms. We only allow the seller to have limited oracle accesses to the players' value distributions, via quantile queries and value queries. For a large class of auction settings, we prove logarithmic lower-bounds for the query complexity for any DSIC Bayesian mechanism to be of any constant approximation to the optimal revenue. For single-item auctions and multi-item auctions with unit-demand or additive valuation functions, we prove tight upper-bounds via efficient query schemes, without requiring the distributions to be regular or have monotone hazard rate. Thus, in those auction settings the seller needs to access much less than the full distributions in order to achieve approximately optimal revenue.

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

↑