10.4230/OASICS.SCOR.2012.11
Morales-Enciso, Sergio
Sergio
Morales-Enciso
Branke, Jürgen
Jürgen
Branke
Revenue maximization through dynamic pricing under unknown market behaviour
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2012
Article
Dynamic pricing
revenue management
EGO
Gaussian processes for classification
Ravizza, Stefan
Stefan
Ravizza
Holborn, Penny
Penny
Holborn
2012
2012-06-26
2012-06-26
2012-06-26
en
urn:nbn:de:0030-drops-35426
10.4230/OASIcs.SCOR.2012
978-3-939897-39-2
2190-6807
10.4230/OASIcs.SCOR.2012
OASIcs, Volume 22, SCOR 2012
3rd Student Conference on Operational Research
2012
22
2
11
20
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ravizza, Stefan
Stefan
Ravizza
Holborn, Penny
Penny
Holborn
2190-6807
Open Access Series in Informatics (OASIcs)
2012
22
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
10 pages
606511 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
We consider the scenario of a multimodal memoryless market to sell one product, where a customer’s probability to actually buy the product depends on the price. We would like to set the price for each customer in a way that maximizes our overall revenue. In this case, an exploration vs. exploitation problem arises. If we explore customer responses to different prices, we get a pretty good idea of what customers are willing to pay. On the other hand, this comes at the cost of losing a customer (when we set the price too high) or selling the product too cheap (when we set the price too low). The goal is to infer the true underlying probability curve as a function of the price (market behaviour) while maximizing the revenue at the same time. This paper focuses on learning the underlying market characteristics with as few data samples as possible by exploiting the knowledge gained from both exploring potentially profitable areas with high uncertainty and optimizing the trade-off between knowledge gained and revenue exploitation. The response variable being binary by nature, classification methods such as logistic regression and Gaussian processes are explored. Two new policies adapted to non parametric inference models are presented, one based on the efficient global optimization (EGO) algorithm and the second based on a dynamic programming approach. Series of simulations of the evolution of the proposed model are finally presented to summarize the achieved performance of the policies.
OASIcs, Vol. 22, 3rd Student Conference on Operational Research, pages 11-20