2 January 2026 in Journal of the American Statistical Association
31 January 2025 in Operations Research
The study On Dynamic Pricing with Covariates introduces novel methods for setting prices when key market factors, or covariates, vary over time. Although most existing literature assumes these factors follow a fixed distribution, the authors show such assumptions are unnecessary for achieving near-optimal pricing strategies. They provide new pricing algorithms with upper regret bounds that match lower regret bounds (up to a logarithmic factor)—even when covariates exhibit no fixed statistical pattern. In particular, the analysis underscores how these algorithms can efficiently adapt to changing market conditions, enabling businesses to continuously optimize their pricing strategies. In addition, the paper extends these results to a constrained scenario with limited, nonreplenishable inventory, unveiling how a variation metric quantifies the effect of temporal shifts in covariates on pricing performance. Numerical experiments validate the practicality of these algorithms. By relaxing common statistical assumptions, this research offers a more flexible approach for data-driven dynamic pricing solutions.
10 June 2025 in Naval Research Logistics (NRL)
5 May 2026 in INFORMS Journal on Data Science
Discrete-choice models, such as multinomial logit, probit, or mixed logit, are widely used in marketing, economics, and operations research: given a set of alternatives, the customer is modeled as choosing one of the alternatives to maximize a (latent) utility function. However, extending such models to situations where the customer chooses more than one item (such as in e-commerce shopping) has proven problematic. Although one can construct reasonable models of the customer’s behavior, estimating such models becomes very challenging because of a combinatorial explosion in the number of possible subsets of items. In this paper, we develop a transformer neural network architecture, the transformer choice net, that is suitable for predicting multiple choices. Transformer networks turn out to be especially suitable for this task as they take into account not only the features of the customer and the items but also the context, which in this case could be the assortment as well as the customer’s past choices. On a range of benchmark data sets, our architecture shows uniformly superior out-of-sample prediction performance compared with the benchmark models in the literature, without requiring any custom modeling for each instance. History: Accepted for the Virtual Special Issue on GenAI, etc., for Business Analytics by Ningyuan Chen, senior editor. Funding: The research of H. Wang was supported by the Emerging Scholar Research Fellowships, University of Sydney Business School. Supplemental Material: The online appendix and code files are available at https://doi.org/10.1287/ijds.2025.0140 .
1 January 2026 in INFORMS Journal on Data Science