The Query Complexity of Uniform Pricing

Proceedings of the ACM Web Conference 2026 2026 Open access

Read full text
Authors: Houshuang Chen, Yaonan Jin, Pinyan Lu, Chihao Zhang
DOI: 10.1145/3774904.3792421
Cited by: 0
References: 15

Abstract

Real-world pricing mechanisms are typically optimized using training data, a setting corresponding to the pricing query complexity problem in Mechanism Design. The previous work [11] studies the single-distribution case1, with tight bounds of ~Θ (ε-3 ) for a general distribution and ~Θ (ε-2 ) for either a regular or monotone-hazard-rate (MHR) distribution, where ε ∈ (0, 1) denotes the (additive) revenue loss of a learned uniform price relative to the Bayesian-optimal uniform price.

Fields of Study & Subjects

Auction Theory and Applications Game Theory and Applications Consumer Market Behavior and Pricing

Publication details

Journal / source
Proceedings of the ACM Web Conference 2026
Publisher
ACM
Pages
237–248
Publication date
12 April 2026
Language
EN