Skip to main content
SpringerLink
Log in

Learn from history for online bipartite matching

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Motivated by various applications in the online platforms for ride-hailing and crowd-sourcing delivery, we study the edge-weighted online bipartite matching (EWOBM) problem. We assume a part of online vertices are released in advance to mimic historical information that the algorithm is able to access. Different from traditional approaches that usually learn informative distributions from large enough history sets, our algorithms enable to extra useful information for the history set of any size. When the online vertices arrive in a random order, we present an online algorithm, named as h -TP-OM, achieving a competitive ratio that increases as more historical information is considered. However, once enough historical information has been fed to the algorithm, additional historical information becomes useless. Based on h -TP-OM, we then propose a time-efficient greedy heuristic, named as h -TP-G, which even has better performances in applications, particularly on large-scale instances. When the arrival order of online vertices is determined by an adversary, we present another greedy heuristic algorithm, named as Greedy-RT. Experiments on both synthetic and real-world datasets are conducted to evaluate the practical performances of the proposed algorithms. The experiment results demonstrate the usefulness of historical information for both h -TP-OM and h -TP-G, and also show the time efficiency of h -TP-G and Greedy-RT.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Availability of data and material

The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.

Notes

  1. The official website of NetworkX is “https://networkx.github.io/".

  2. The official website is “https://gaia.didichuxing.com".

References

  • Aggarwal G, Goel G, Karande C, Mehta A (2011) Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: SODA, pp 1253–1264

  • Bahmani B, Kapralov M (2010) Improved bounds for online stochastic matching. In: ESA, pp 170–181

  • Borodin A, Karavasilis C, Pankratov D (2020) An experimental study of algorithms for online bipartite matching. J Exp Algorithmics 25(1):1–37

    Article  MathSciNet  Google Scholar 

  • Brubach B, Sankararaman KA, Srinivasan A, Xu P (2016) Online stochastic matching: New algorithms and bounds. In: ESA, pp 1–16

  • Chen XA, Wang Z (2015) A dynamic learning algorithm for online matching problems with concave returns. Eur J Oper Res 247(2):379–388

    Article  MathSciNet  MATH  Google Scholar 

  • Devanur N R, Jain K, Kleinberg R (2013) Randomized primal-dual analysis of ranking for online bipartite matching. In: Proceedings of the twenty-fourth annual ACM-SIAM symposium on discrete algorithms, pp 101–107

  • Dickerson J P, Sankararaman K A, Srinivasan A, Xu P (2018) Allocation problems in ride-sharing platforms: Online matching with offline reusable resources. In: AAAI, pp 1007–1014

  • DIDI (2016) Gaia open dataset

  • Esfandiari H, Korula N, Mirrokni V (2018) Allocation with traffic spikes: mixing adversarial and stochastic models. ACM Trans Econ Comput 6(3–4):1–23

    Article  MathSciNet  Google Scholar 

  • Fahrbach M, Huang Z, Tao R, Zadimoghaddam M (2020) Edge-weighted online bipartite matching. CoRR, arXiv:2005.01929

  • Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1/e. In: FOCS, pp 117–126

  • Goel G, Mehta A (2008) Online budgeted matching in random input models with applications to adwords. SODA 8:982–991

    MathSciNet  MATH  Google Scholar 

  • Haeupler B, Mirrokni V S, Zadimoghaddam M (2011) Online stochastic weighted matching: Improved approximation algorithms. In: International workshop on internet and network economics, pp 170–181

  • Huang Z, Tang ZG, Wu X, Zhang Y (2019) Online vertex-weighted bipartite matching: Beating 1–1/e with random arrivals. ACM Trans Algorithms (TALG) 15(3):1–15

    Article  MathSciNet  MATH  Google Scholar 

  • Jaillet P, Lu X (2014) Online stochastic matching: New algorithms with better bounds. Math Oper Res 39(3):624–646

    Article  MathSciNet  MATH  Google Scholar 

  • Kalyanasundaram B, Pruhs KR (2000) An optimal deterministic algorithm for online b-matching. Theor Comput Sci 233(1):319–325

    Article  MathSciNet  MATH  Google Scholar 

  • Kaplan H, Naori D, Raz D (2020) Competitive analysis with a sample and the secretary problem. In: SODA, pp 2082–2095

  • Karande C, Mehta A, Tripathi P (2011) Online bipartite matching with unknown distributions. In: STOC, pp 587-596

  • Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. In: STOC, pp 352–358

  • Kesselheim T, Radke K, Tönnis A, Vöcking B (2013) An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In: ESA, pp 589–600

  • Korula N, Pál M (2009) Algorithms for secretary problems on graphs and hypergraphs. In: ICALP, pp 508–520

  • Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Quart 2(1–2):83–97

    Article  MathSciNet  MATH  Google Scholar 

  • Legrain A, Jaillet P (2016) A stochastic algorithm for online bipartite resource allocation problems. Comput Oper Res 75:28–37

    Article  MathSciNet  MATH  Google Scholar 

  • Mahdian M, Yan Q (2011) Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps. In: STOC, pp 597–606

  • Manshadi VH, Gharan SO, Saberi A (2012) Online stochastic matching: online actions based on offline statistics. Math Oper Res 37(4):559–573

    Article  MathSciNet  MATH  Google Scholar 

  • Mehta A (2013) Online matching and ad allocation. Found Trends Theor Comput Sci 8(4):265–368

    Article  MathSciNet  MATH  Google Scholar 

  • Sun X, Zhang J, Zhang J (2017) Near optimal algorithms for online weighted bipartite matching in adversary model. J Comb Optim 34(3):689–705

    Article  MathSciNet  MATH  Google Scholar 

  • Ting H-F, Xiang X (2015) Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching. Theor Comput Sci 607:247–256

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

HZ was partially supported by National Nature Science Foundation of China (Grant Nos. 72071157, 71732006, 72192834), and China Postdoctoral Science Foundation (Grant No. 2016M592811). KL received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant agreement number 754462. We thank DiDi Chuxing GAIA Open Dataset Initiative for the DIDI dataset.

Author information

Authors and Affiliations

  1. School of Management, State Key Lab for Manufacturing Systems Engineering, Xi’an Jiaotong University, Xi’an, 710049, China

    Huili Zhang & Rui Du

  2. Institute of computer science, University of Bonn, 53113, Bonn, Germany

    Kelin Luo

  3. Department of Computer Science, Georgia Southern University, Statesboro, GA, 48197, USA

    Weitian Tong

Authors
  1. Huili Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rui Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kelin Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Weitian Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weitian Tong.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Code availability

The code generated during the current study is available from the corresponding author on reasonable request.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, H., Du, R., Luo, K. et al. Learn from history for online bipartite matching. J Comb Optim 44, 3611–3640 (2022). https://doi.org/10.1007/s10878-022-00916-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-022-00916-4

Keywords

Search

Navigation