Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection
Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection
In the Bayesian online selection problem, the goal is to design a pricing scheme for a sequence of arriving buyers that maximizes the expected social-welfare (or revenue) subject to different types of structural constraints. Inspired by applications in operations management, the focus of this paper is on the cases where …