Journal article · 2020 · Open access

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios

Will Ma, David Simchi‐Levi

Operations Research, 68(6), 1787–1803 · Published 2 June 2020 · DOI 10.1287/opre.2019.1957

Open PDFView at the publisherCite this paper

In brief

“Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios” is a 2020 journal article by Will Ma and David Simchi‐Levi, published in Operations Research. OpenAlex counts 119 citations as of 19 November 2026, which puts it in the top 4% of works published in 2020 by citations. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
119
Most cited in
2026 (23)
Field-weighted impact
7.67
References
39
Authors
2

Abstract

Resource Allocation and Pricing in the Absence of a Demand Forecast

Cite this paper

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

APA 7

Ma, W., & Simchi‐Levi, D. (2020). Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios. Operations Research, 68(6), 1787–1803. https://doi.org/10.1287/opre.2019.1957

MLA 9

Ma, Will, and David Simchi‐Levi. “Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios.” Operations Research, vol. 68, no. 6, 2020, pp. 1787–1803. https://doi.org/10.1287/opre.2019.1957.

Chicago

Ma, Will and David Simchi‐Levi. 2020. “Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios.” Operations Research 68 (6): 1787–1803. https://doi.org/10.1287/opre.2019.1957.

Harvard

Ma, W. and Simchi‐Levi, D. (2020) ‘Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios’, Operations Research, 68(6), pp. 1787–1803. doi:10.1287/opre.2019.1957.

IEEE

W. Ma and D. Simchi‐Levi, “Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios,” Operations Research, vol. 68, no. 6, pp. 1787–1803, 2020, doi: 10.1287/opre.2019.1957.

BibTeX

@article{ma2020algorithms,
  title     = {{Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios}},
  author    = {Ma, Will and Simchi‐Levi, David},
  journal   = {Operations Research},
  year      = {2020},
  volume    = {68},
  number    = {6},
  pages     = {1787--1803},
  doi       = {10.1287/opre.2019.1957},
  url       = {https://doi.org/10.1287/opre.2019.1957}
}

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

Citations by year

YearCitationsShare of the best year
201833
201955
20201010
202199
20222222
20231010
20241515
20252222
20262323

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

Topic and keywords

Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems

  • online matching
  • assortment planning
  • pricing
  • competitive ratio
  • resource allocation
  • demand uncertainty
  • dynamic pricing

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Ma, W., & Simchi‐Levi, D. (2020). Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios. Operations Research, 68(6), 1787–1803. https://doi.org/10.1287/opre.2019.1957

How many times has this paper been cited?

119 times, according to OpenAlex on 19 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 arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Will Ma, David Simchi‐Levi.

What is the DOI of this paper?

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

Bibliographic data from OpenAlex (CC0), last checked 19 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.