EUVIMEDEUVIMED entdecken
Crossref

On the Optimality of Greedy Policies in Dynamic Matching

Süleyman Kerimov, Itai Ashlagi, Itai Gurvich

Operations Research · 2025-01 · 73 (1) · 560-582

DOI: 10.1287/opre.2021.0596 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Operations Research, 2025-01. Verfasst von Süleyman Kerimov und 2 weiteren Autor:innen. Die Arbeit wurde bisher 29-mal zitiert (Crossref) und nennt 19 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Hindsight Optimality in Two-Way Matching Networks In “On the Optimality of Greedy Policies in Dynamic Matching”, Kerimov, Ashlagi, and Gurvich study centralized dynamic matching markets with finitely many agent types and heterogeneous match values. A matching policy is hindsight optimal if the policy can (nearly) maximize the total value simultaneously at all times. The article establishes that suitably designed greedy policies are hindsight optimal in two-way matching networks. This implies that there is essentially no positive externality from having agents waiting to form future matches. Proposed policies include the greedy longest-queue policy, with a minor variation, as well as a greedy static priority policy. The matching networks considered in this work satisfy a general position condition. General position is a weak (but necessary) condition that holds when the static-planning problem (a linear program that optimizes the first-order matching rates) has a unique and nondegenerate optimal solution.

Zitieren

APA

Kerimov, S., Ashlagi, I., & Gurvich, I. (2025). On the Optimality of Greedy Policies in Dynamic Matching. Operations Research, 73(1), 560-582. https://doi.org/10.1287/opre.2021.0596

Vancouver

Kerimov S, Ashlagi I, Gurvich I. On the Optimality of Greedy Policies in Dynamic Matching. Operations Research. 2025;73(1):560-582. doi:10.1287/opre.2021.0596

BibTeX
@article{Kerimov2025,
  author = {Kerimov, Süleyman and Ashlagi, Itai and Gurvich, Itai},
  title = {On the Optimality of Greedy Policies in Dynamic Matching},
  journal = {Operations Research},
  year = {2025},
  volume = {73},
  number = {1},
  pages = {560--582},
  doi = {10.1287/opre.2021.0596}
}
Kostenlos starten →