-

 

 

 




Optimization Online





 

Model-Free Assortment Pricing with Transaction Data

Ningyuan Chen (ningyuan.chen***at***utoronto.ca)
Andre Cire (andre.cire***at***rotman.utoronto.ca)
Ming Hu (ming.hu***at***rotman.utoronto.ca)
Saman Lagzi (saman.lagzi***at***rotman.utoronto.ca)

Abstract: We study a problem in which a firm sets prices for products based on the transaction data, i.e., which product past customers chose from an assortment and what were the historical prices that they observed. Our approach does not impose a model on the distribution of the customers' valuations and only assumes, instead, that purchase choices satisfy incentive-compatible constraints. The individual valuation of each past customer can then be encoded as a polyhedral set, and our approach maximizes the worst-case revenue assuming that new customers' valuations are drawn from the empirical distribution implied by the collection of such polyhedra. We show that the optimal prices in this setting can be approximated at any arbitrary precision by solving a compact mixed-integer linear program. Moreover, we study special practical cases where the program can be solved efficiently, and design three approximation strategies that are of low computational complexity and interpretable. Comprehensive numerical studies based on synthetic and real data suggest that our pricing approach is uniquely beneficial when the historical data has a limited size or is susceptible to model misspecification.

Keywords: data-driven; incentive-compatible; robust optimization; product pricing; small data

Category 1: Applications -- OR and Management Sciences

Category 2: Robust Optimization

Category 3: Combinatorial Optimization (Approximation Algorithms )

Citation: Working paper No. 3759397, University of Toronto, Rotman School of Management.

Download: [PDF]

Entry Submitted: 01/03/2021
Entry Accepted: 01/04/2021
Entry Last Modified: 01/05/2021

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society