Skip to main content
SpringerLink
Log in

Near optimal algorithms for online weighted bipartite matching in adversary model

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

Abstract

Bipartite matching is an important problem in graph theory. With the prosperity of electronic commerce, such as online auction and AdWords allocation, bipartite matching problem has been extensively studied under online circumstances. In this work, we study the online weighted bipartite matching problem in adversary model, that is, there is a weighted bipartite graph \(G=(L,R,E)\) and the left side L is known as input, while the vertices in R come one by one in an order arranged by the adversary. When each vertex in R comes, its adjacent edges and relative weights are revealed. The algorithm should irreversibly decide whether to match this vertex to an unmatched neighbor in L with the objective to maximize the total weight of the obtained matching. When the weights are unbounded, the best algorithm can only achieve a competitive ratio \(\varTheta \left( \frac{1}{n}\right) \), where n is the number of vertices coming online. Thus, we mainly deal with two variants: the bounded weight problem in which all weights are in the range \([\alpha , \beta ]\), and the normalized summation problem in which each vertex in one side has the same total weights. We design algorithms for both variants with competitive ratio \(\varTheta \left( \max \left\{ \frac{1}{\log \frac{\beta }{\alpha }},\frac{1}{n}\right\} \right) \) and \(\varTheta \left( \frac{1}{\log n}\right) \) respectively. Furthermore, we show these two competitive ratios are tight by providing the corresponding hardness results.

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

Similar content being viewed by others

References

  • Aggarwal G, Goel G, Karande C, Mehta A (2011) Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the 22nd annual ACM-SIAM symposium on Discrete Algorithms, SIAM, pp 1253–1264

  • Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp 434–443

  • Buchbinder N, Jain K, Naor JS (2007) Online primal-dual algorithms for maximizing ad-auctions revenue. In: Algorithms–ESA 2007, Springer, pp 253–264

  • Devanur NR, Hayes TP (2009) The adwords problem: online keyword matching with budgeted bidders under random permutations. In: Proceedings of the 10th ACM conference on Electronic commerce, pp 71–78

  • Devanur NR, Jain K, Kleinberg RD (2013) Randomized primal-dual analysis of ranking for online bipartite matching. In: Proceedings of the 24th fourth annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp 101–107

  • Dimitrov NB, Plaxton CG (2008) Competitive weighted matching in transversal matroids. Springer, New York

    Book  MATH  Google Scholar 

  • Esfandiari H, Korula N, Mirrokni V (2015) Online allocation with traffic spikes: Mixing adversarial and stochastic models. In: Sixteenth ACM conference on economics and computation, pp 169–186

  • Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: beating 1-1/e. In: Proceedings of the 2009 50th annual IEEE symposium on foundations of computer science, pp 117–126

  • Goel G, Mehta A (2008) Online budgeted matching in random input models with applications to adwords. In: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pp 982–991

  • Haeupler B, Mirrokni VS, Zadimoghaddam M (2011) Online stochastic weighted matching: Improved approximation algorithms. In: Internet and network economics, Springer, pp 170–181

  • Jaillet P, Lu X (2013) Online stochastic matching: new algorithms with better bounds. Mathematics of Operations Research 39(3):624–646

    Article  MathSciNet  MATH  Google Scholar 

  • Kalyanasundaram B, Pruhs K (1996) An optimal deterministic algorithm for online b-matching. Theoretical Computer Science 233(12):319–325

    MathSciNet  MATH  Google Scholar 

  • Karande C, Mehta A, Tripathi P (2011) Online bipartite matching with unknown distributions. In: Proceedings of the 43rd annual ACM symposium on Theory of computing, ACM, pp 587–596

  • Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. In: Proceedings of the 22nd annual ACM symposium on theory of computing, ACM, pp 352–358

  • Kell N, Panigrahi D (2016) Online budgeted allocation with general budgets. In: ACM conference on economics and computation

  • 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: Proceedings of the 21st European symposium on algorithms, pp 589–600

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

  • Mahdian M, Yan Q (2011) Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps. In: Proceedings of the forty-third annual ACM symposium on Theory of computing, ACM, pp 597–606

  • Mahdian M, Nazerzadeh H, Saberi A (2007) Allocating online advertisement space with unreliable estimates. In: Proceedings of the 8th ACM conference on Electronic commerce, pp 288–294

  • 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, Saberi A, Vazirani U, Vazirani V (2007) Adwords and generalized online matching. J ACM 54(5):22

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Wang Y, Wong CW (2016) Matroid online bipartite matching and vertex cover. In: ACM conference on economics and computation

  • Yao ACC (1977) Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of the 18th annual symposium on foundations of computer science, pp 222–227

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China Grant 61222202, 61433014, 61502449, 61602440, the 973 Program of China Grants No. 2016YFB1000201 and the China National Program for support of Top-notch Young Professionals.

Author information

Authors and Affiliations

  1. CAS Key Lab of Network Data Science and Technology, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100190, China

    Xiaoming Sun, Jia Zhang & Jialin Zhang

  2. University of Chinese Academy of Sciences, Beijing, 100049, China

    Xiaoming Sun, Jia Zhang & Jialin Zhang

Authors
  1. Xiaoming Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jialin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jia Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, X., Zhang, J. & Zhang, J. Near optimal algorithms for online weighted bipartite matching in adversary model. J Comb Optim 34, 689–705 (2017). https://doi.org/10.1007/s10878-016-0100-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-016-0100-2

Keywords

Search

Navigation