资源论文Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer

Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer

2020-02-19 | |  63 |   46 |   0

Abstract

We study revenue optimization pricing algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation. When the participants non-equally discount their cumulative utilities, we show that the optimal constant pricing (which offers the Myerson price) is no longer optimal. In the case of more patient seller, we propose a novel multidimensional optimization functional — a generalization of the one used to determine Myerson’s price. This functional allows to find the optimal algorithm and to boost revenue of the optimal static pricing by an efficient low-dimensional approximation. Numerical experiments are provided to support our results.

上一篇:Code Generation as a Dual Task of Code Summarization

下一篇:A Simple Baseline for Bayesian Uncertainty in Deep Learning

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...