Journal article · 2022 · Open access

A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint

Ningyuan Chen, Guillermo Gallego

Mathematics of Operations Research, 47(4), 2585–2613 · Published 10 February 2022 · DOI 10.1287/moor.2021.1220

Open PDFView at the publisherCite this paper

In brief

“A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint” is a 2022 journal article by Ningyuan Chen and Guillermo Gallego, published in Mathematics of Operations Research. OpenAlex counts 53 citations as of 21 November 2026. It is open access: the full text is free to read at RePEc: Research Papers in Economics.

Citations
53
Most cited in
2026 (17)
Field-weighted impact
3.67
References
44
Authors
2

Abstract

We consider the problem of a firm seeking to use personalized pricing to sell an exogenously given stock of a product over a finite selling horizon to different consumer types. We assume that the type of an arriving consumer can be observed, but the demand function associated with each type is initially unknown. The firm sets personalized prices dynamically for each type and attempts to maximize the revenue over the season. We provide a learning algorithm that is near optimal when the demand and capacity scale in proportion. The algorithm utilizes the primal–dual formulation of the problem and learns the dual optimal solution explicitly. It allows the algorithm to overcome the curse of dimensionality (the rate of regret is independent of the number of types) and sheds light on novel algorithmic designs for learning problems with resource constraints.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Chen, N., & Gallego, G. (2022). A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint. Mathematics of Operations Research, 47(4), 2585–2613. https://doi.org/10.1287/moor.2021.1220

MLA 9

Chen, Ningyuan, and Guillermo Gallego. “A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint.” Mathematics of Operations Research, vol. 47, no. 4, 2022, pp. 2585–2613. https://doi.org/10.1287/moor.2021.1220.

Chicago

Chen, Ningyuan and Guillermo Gallego. 2022. “A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint.” Mathematics of Operations Research 47 (4): 2585–2613. https://doi.org/10.1287/moor.2021.1220.

Harvard

Chen, N. and Gallego, G. (2022) ‘A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint’, Mathematics of Operations Research, 47(4), pp. 2585–2613. doi:10.1287/moor.2021.1220.

IEEE

N. Chen and G. Gallego, “A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint,” Mathematics of Operations Research, vol. 47, no. 4, pp. 2585–2613, 2022, doi: 10.1287/moor.2021.1220.

BibTeX

@article{chen2022primal,
  title     = {{A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint}},
  author    = {Chen, Ningyuan and Gallego, Guillermo},
  journal   = {Mathematics of Operations Research},
  year      = {2022},
  volume    = {47},
  number    = {4},
  pages     = {2585--2613},
  doi       = {10.1287/moor.2021.1220},
  url       = {https://doi.org/10.1287/moor.2021.1220}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201811
202011
202122
202244
202366
202488
20251414
20261717

Its field-weighted citation impact is 3.67: it has been cited 3.67 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Supply Chain and Inventory Management

  • inventory constraints
  • revenue maximization
  • consumer types
  • regret bounds
  • curse of dimensionality
  • resource constraints
  • online learning

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Chen, N., & Gallego, G. (2022). A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint. Mathematics of Operations Research, 47(4), 2585–2613. https://doi.org/10.1287/moor.2021.1220

How many times has this paper been cited?

53 times, according to OpenAlex on 21 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at RePEc: Research Papers in Economics: sign in and open the PDF from this page.

Who wrote this paper?

Ningyuan Chen, Guillermo Gallego.

What is the DOI of this paper?

10.1287/moor.2021.1220, permanently at https://doi.org/10.1287/moor.2021.1220. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 21 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.