Dynamic Pricing in Competitive Markets

09/14/2017
by   Paresh Nakhe, et al.
0

Dynamic pricing of goods in a competitive environment to maximize revenue is a natural objective and has been a subject of research over the years. In this paper, we focus on a class of markets exhibiting the substitutes property with sellers having divisible and replenishable goods. Depending on the prices chosen, each seller observes a certain demand which is satisfied subject to the supply constraint. The goal of the seller is to price her good dynamically so as to maximize her revenue. For the static market case, when the consumer utility satisfies the Constant Elasticity of Substitution (CES) property, we give a O(√(T)) regret bound on the maximum loss in revenue of a seller using a modified version of the celebrated Online Gradient Descent Algorithm by Zinkevich. For a more specialized set of consumer utilities satisfying the iso-elasticity condition, we show that when each seller uses a regret-minimizing algorithm satisfying a certain technical property, the regret with respect to (1-α) times optimal revenue is bounded as O(T^1/4 / √(α)). We extend this result to markets with dynamic supplies and prove a corresponding dynamic regret bound, whose guarantee deteriorates smoothly with the inherent instability of the market. As a side-result, we also extend the previously known convergence results of these algorithms in a general game to the dynamic setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2021

Dynamic Pricing and Learning under the Bass Model

We consider a novel formulation of the dynamic pricing and demand learni...
research
11/28/2019

Online Pricing with Reserve Price Constraint for Personal Data Markets

The society's insatiable appetites for personal data are driving the eme...
research
01/13/2017

Perishability of Data: Dynamic Pricing under Varying-Coefficient Models

We consider a firm that sells a large number of products to its customer...
research
11/08/2019

Incentive-aware Contextual Pricing with Non-parametric Market Noise

We consider a dynamic pricing problem for repeated contextual second-pri...
research
03/16/2020

Online Algorithms for Dynamic Matching Markets in Energy Distribution Systems

In this paper we address the problem of designing online algorithms for ...
research
09/07/2020

Nearly Bounded Regret of Re-solving Heuristics in Price-based Revenue Management

Price-based revenue management is a class of important questions in oper...
research
10/18/2016

Dynamic Assortment Personalization in High Dimensions

We study the problem of dynamic assortment personalization with large, h...

Please sign up or login with your details

Forgot password? Click here to reset