The IID Prophet Inequality with Limited Flexibility

10/11/2022
by   Sebastian Perez-Salazar, et al.
0

In online sales, sellers usually offer each potential buyer a posted price in a take-it-or-leave fashion. Buyers can sometimes see posted prices faced by other buyers, and changing the price frequently could be considered unfair. The literature on posted price mechanisms and prophet inequality problems has studied the two extremes of pricing policies, the fixed price policy and fully dynamic pricing. The former is suboptimal in revenue but is perceived as fairer than the latter. This work examines the middle situation, where there are at most k distinct prices over the selling horizon. Using the framework of prophet inequalities with independent and identically distributed random variables, we propose a new prophet inequality for strategies that use at most k thresholds. We present asymptotic results in k and results for small values of k. For k=2 prices, we show an improvement of at least 11% over the best fixed-price solution. Moreover, k=5 prices suffice to guarantee almost 99% of the approximation factor obtained by a fully dynamic policy that uses an arbitrary number of prices. From a technical standpoint, we use an infinite-dimensional linear program in our analysis; this formulation could be of independent interest to other online selection problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2022

Doubly Fair Dynamic Pricing

We study the problem of online dynamic pricing with two types of fairnes...
research
03/06/2018

An Online Algorithm for Learning Buyer Behavior under Realistic Pricing Restrictions

We propose a new efficient online algorithm to learn the parameters gove...
research
07/22/2021

The Stationary Prophet Inequality Problem

We study a continuous and infinite time horizon counterpart to the class...
research
05/21/2021

When is Assortment Optimization Optimal?

A classical question in economics is whether complex, randomized selling...
research
06/12/2019

Prophet Inequalities on the Intersection of a Matroid and a Graph

We consider prophet inequalities in a setting where agents correspond to...
research
11/18/2020

Non-Adaptive Matroid Prophet Inequalities

We investigate non-adaptive algorithms for matroid prophet inequalities....
research
04/21/2020

An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions

Prophet inequalities compare the expected performance of an online algor...

Please sign up or login with your details

Forgot password? Click here to reset