Near optimal algorithms for online weighted bipartite matching in adversary model

Xiaoming Sun (), Jia Zhang () and Jialin Zhang ()
Additional contact information
Xiaoming Sun: Chinese Academy of Sciences
Jia Zhang: Chinese Academy of Sciences
Jialin Zhang: Chinese Academy of Sciences

Journal of Combinatorial Optimization, 2017, vol. 34, issue 3, No 3, 689-705

Abstract: 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)$$ 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) $$ Θ 1 n , 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) $$ Θ max 1 log β α , 1 n and $$\varTheta \left( \frac{1}{\log n}\right) $$ Θ 1 log n respectively. Furthermore, we show these two competitive ratios are tight by providing the corresponding hardness results.

Keywords: Online matching; Weighted bipartite graph; Adversary model; Near optimal algorithm (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0100-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:3:d:10.1007_s10878-016-0100-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0100-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().