IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v31y2022i8p3096-3124.html
   My bibliography  Save this article

A nonasymptotic analysis for re‐solving heuristic in online matching

Author

Listed:
  • Hao Wang
  • Zhenzhen Yan
  • Xiaohui Bei

Abstract

We investigate an online edge‐weighted bipartite matching problem with general capacity constraints. In this problem, the resources are offline and nonreplenishable with different capacities. Demands arrive online and each requests a certain amount of resources. The goal is to maximize the reward generated by successful matches. We model the offline optimization problem as a deterministic linear program (LP) and present multiple randomized online algorithms based on the solution to the offline LP. We analyze the performance guarantee of each algorithm in terms of its competitive ratio (CR). Importantly, we introduce a re‐solving heuristic that periodically recomputes the offline LP and uses the updated offline solution to guide the online algorithm decisions. We find that the algorithm's CR can be significantly improved when re‐solving at carefully selected time steps. Finally, we investigate the value of the demand distribution in further improving the algorithm efficiency. We conduct extensive numerical studies to demonstrate the efficiency of the proposed algorithms. The effect of market conditions on the algorithm performance is also investigated.

Suggested Citation

  • Hao Wang & Zhenzhen Yan & Xiaohui Bei, 2022. "A nonasymptotic analysis for re‐solving heuristic in online matching," Production and Operations Management, Production and Operations Management Society, vol. 31(8), pages 3096-3124, August.
    • Handle: RePEc:bla:popmgt:v:31:y:2022:i:8:p:3096-3124
    DOI: 10.1111/poms.13738
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.13738
    Download Restriction: no
    File URL: https://libkey.io/10.1111/poms.13738?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Clifford Stein & Van-Anh Truong & Xinshang Wang, 2020. "Advance Service Reservations with Heterogeneous Customers," Management Science, INFORMS, vol. 66(7), pages 2929-2950, July.
    2. Patrick Jaillet & Xin Lu, 2014. "Online Stochastic Matching: New Algorithms with Better Bounds," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 624-646, August.
    3. Martin I. Reiman & Qiong Wang, 2008. "An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 257-282, May.
    4. Vahideh H. Manshadi & Shayan Oveis Gharan & Amin Saberi, 2012. "Online Stochastic Matching: Online Actions Based on Offline Statistics," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 559-573, November.
    5. Will Ma & David Simchi-Levi, 2020. "Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios," Operations Research, INFORMS, vol. 68(6), pages 1787-1803, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alberto Vera & Siddhartha Banerjee, 2021. "The Bayesian Prophet: A Low-Regret Framework for Online Decision Making," Management Science, INFORMS, vol. 67(3), pages 1368-1391, March.
    2. Ali Aouad & Daniela Saban, 2023. "Online Assortment Optimization for Two-Sided Matching Platforms," Management Science, INFORMS, vol. 69(4), pages 2069-2087, April.
    3. Huili Zhang & Rui Du & Kelin Luo & Weitian Tong, 2022. "Learn from history for online bipartite matching," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3611-3640, December.
    4. Vahideh Manshadi & Scott Rodilitz, 2022. "Online Policies for Efficient Volunteer Crowdsourcing," Management Science, INFORMS, vol. 68(9), pages 6572-6590, September.
    5. Will Ma & David Simchi-Levi, 2020. "Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios," Operations Research, INFORMS, vol. 68(6), pages 1787-1803, November.
    6. Moussawi-Haidar, Lama & Nasr, Walid & Jalloul, Maya, 2021. "Standardized cargo network revenue management with dual channels under stochastic and time-dependent demand," European Journal of Operational Research, Elsevier, vol. 295(1), pages 275-291.
    7. Ge Yu & Sheldon H. Jacobson, 2020. "Primal-dual analysis for online interval scheduling problems," Journal of Global Optimization, Springer, vol. 77(3), pages 575-602, July.
    8. Patrick Jaillet & Xin Lu, 2014. "Online Stochastic Matching: New Algorithms with Better Bounds," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 624-646, August.
    9. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2016. "Real-Time Dynamic Pricing with Minimal and Flexible Price Adjustment," Management Science, INFORMS, vol. 62(8), pages 2437-2455, August.
    10. Johannes Baumler & Martin Bullinger & Stefan Kober & Donghao Zhu, 2022. "Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets," Papers 2206.10287, arXiv.org, revised Jun 2023.
    11. Xi, Haoning & Liu, Wei & Waller, S. Travis & Hensher, David A. & Kilby, Philip & Rey, David, 2023. "Incentive-compatible mechanisms for online resource allocation in Mobility-as-a-Service systems," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 119-147.
    12. Omar Besbes & Costis Maglaras, 2012. "Dynamic Pricing with Financial Milestones: Feedback-Form Policies," Management Science, INFORMS, vol. 58(9), pages 1715-1731, September.
    13. Stefanus Jasin & Amitabh Sinha, 2015. "An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment," Operations Research, INFORMS, vol. 63(6), pages 1336-1351, December.
    14. Xiaoming Sun & Jia Zhang & Jialin Zhang, 2017. "Near optimal algorithms for online weighted bipartite matching in adversary model," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 689-705, October.
    15. Yanzhe (Murray) Lei & Stefanus Jasin & Amitabh Sinha, 2018. "Joint Dynamic Pricing and Order Fulfillment for E-commerce Retailers," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 269-284, May.
    16. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    17. Alfredo Torrico & Alejandro Toriello, 2022. "Dynamic Relaxations for Online Bipartite Matching," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1871-1884, July.
    18. Clifford Stein & Van-Anh Truong & Xinshang Wang, 2020. "Advance Service Reservations with Heterogeneous Customers," Management Science, INFORMS, vol. 66(7), pages 2929-2950, July.
    19. Santiago R. Balseiro & David B. Brown, 2019. "Approximations to Stochastic Dynamic Programs via Information Relaxation Duality," Operations Research, INFORMS, vol. 67(2), pages 577-597, March.
    20. Yanzhe (Murray) Lei & Stefanus Jasin, 2020. "Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements," Operations Research, INFORMS, vol. 68(3), pages 676-685, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:popmgt:v:31:y:2022:i:8:p:3096-3124. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.