Stochastic Strategic Patient Buyers: Revenue maximization using posted prices

02/12/2022
by   Eitan-Hai Mashiah, et al.
0

We consider a seller faced with buyers which have the ability to delay their decision, which we call patience. Each buyer's type is composed of value and patience, and it is sampled i.i.d. from a distribution. The seller, using posted prices, would like to maximize her revenue from selling to the buyer. Our main results are the following. ∙ We formalize this setting and characterize the resulting Stackelberg equilibrium, where the seller first commits to her strategy and then the buyers best respond. ∙ We show a separation between the best fixed price, the best pure strategy, which is a fixed sequence of prices, and the best mixed strategy, which is a distribution over price sequences. ∙ We characterize both the optimal pure strategy of the seller and the buyer's best response strategy to any seller's mixed strategy. ∙ We show how to compute efficiently the optimal pure strategy and give an algorithm for the optimal mixed strategy (which is exponential in the maximum patience). We then consider a learning setting, where the seller does not have access to the distribution over buyer's types. Our main results are the following. ∙ We derive a sample complexity bound for the learning of an approximate optimal pure strategy, by computing the fat-shattering dimension of this setting. ∙ We give a general sample complexity bound for the approximate optimal mixed strategy. ∙ We consider an online setting and derive a vanishing regret bound with respect to both the optimal pure strategy and the optimal mixed strategy.

READ FULL TEXT
research
02/16/2023

Equilibrium and Learning in Fixed-Price Data Markets with Externality

We propose modeling real-world data markets, where sellers post fixed pr...
research
11/21/2022

Sample-optimal classical shadows for pure states

We consider the classical shadows task for pure states in the setting of...
research
06/19/2023

Optimal Pure Strategies for a Discrete Search Game

Consider a two-person zero-sum search game between a Hider and a Searche...
research
02/27/2019

Learning to bid in revenue-maximizing auctions

We consider the problem of the optimization of bidding strategies in pri...
research
02/09/2019

Pure Exploration with Multiple Correct Answers

We determine the sample complexity of pure exploration bandit problems w...
research
12/13/2018

Profit and Strategic Analysis for MNO-MVNO Partnership

We consider a mobile market driven by two Mobile Network Operators (MNOs...
research
02/04/2022

Optimal Spend Rate Estimation and Pacing for Ad Campaigns with Budgets

Online ad platforms offer budget management tools for advertisers that a...

Please sign up or login with your details

Forgot password? Click here to reset