Optimal Pricing In Black Box Producer-Consumer Stackelberg Games Using Revealed Preference Feedback

This paper considers an optimal pricing problem for the black box producer-consumer Stackelberg game. A producer sets price over a set of goods to maximize his profit (the difference in revenue and cost function). The consumer buys quantity to maximize his utility function. The utility function of the consumer and the cost function of the producer are ‘black box’ functions (unknown functions with limited evaluations). Using a Gaussian process framework we derive a Bayesian algorithm for learning the optimal price. Numerical results illustrate the efficacy of our approach compared to existing literature.

[1]  Vikram Krishnamurthy,et al.  Afriat's Test for Detecting Malicious Agents , 2012, IEEE Signal Processing Letters.

[2]  H. Varian Revealed Preference , 2006 .

[3]  Roman Garnett,et al.  Sampling for Inference in Probabilistic Models with Fast Bayesian Quadrature , 2014, NIPS.

[4]  Aaron Roth,et al.  Watch and learn: optimizing from revealed preferences feedback , 2015, SECO.

[5]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.

[6]  Hal R. Varian,et al.  Revealed Preference and its Applications , 2012 .

[7]  Rahul Deb,et al.  A testable model of consumption with externalities , 2009, J. Econ. Theory.

[8]  Kristiaan Kerstens,et al.  Total factor productivity growth and convergence in the petroleum industry : empirical analysis testing for convexity , 2012 .

[9]  Michael P. Wellman Methods for Empirical Game-Theoretic Analysis , 2006, AAAI.

[10]  S. Afriat THE CONSTRUCTION OF UTILITY FUNCTIONS FROM EXPENDITURE DATA , 1967 .

[11]  Valerie A. Ramey,et al.  Nonconvex Costs and the Behavior of Inventories , 1991, Journal of Political Economy.

[12]  Aaron Roth,et al.  Online Learning and Profit Maximization from Revealed Preferences , 2014, AAAI.

[13]  James O. Berger,et al.  Estimating Shape Constrained Functions Using Gaussian Processes , 2016, SIAM/ASA J. Uncertain. Quantification.

[14]  Andreas Krause,et al.  Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting , 2009, IEEE Transactions on Information Theory.

[15]  Michael Szenberg,et al.  Samuelsonian Economics and the Twenty‐First Century , 2006 .

[16]  Michael P. Wellman,et al.  Strategy exploration in empirical games , 2010, AAMAS.