File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.4230/LIPIcs.ICALP.2018.79
- Scopus: eid_2-s2.0-85049784654
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
Title | Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals |
---|---|
Authors | |
Keywords | Online bipartite matching Randomized primal-dual Vertex weighted |
Issue Date | 2018 |
Publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. |
Citation | Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 9-13 July 2018, article no. 79:1--79:14 How to Cite? |
Abstract | We introduce a weighted version of the ranking algorithm by Karp et al. (STOC 1990), and prove a competitive ratio of 0.6534 for the vertex-weighted online bipartite matching problem when online vertices arrive in random order. Our result shows that random arrivals help beating the 1-1/e barrier even in the vertex-weighted case. We build on the randomized primal-dual framework by Devanur et al. (SODA 2013) and design a two dimensional gain sharing function, which depends not only on the rank of the offline vertex, but also on the arrival time of the online vertex. To our knowledge, this is the first competitive ratio strictly larger than 1-1/e for an online bipartite matching problem achieved under the randomized primal-dual framework. Our algorithm has a natural interpretation that offline vertices offer a larger portion of their weights to the online vertices as time goes by, and each online vertex matches the neighbor with the highest offer at its arrival. |
Persistent Identifier | http://hdl.handle.net/10722/261433 |
ISBN | |
Series/Report no. | Leibniz International Proceedings in Informatics (LIPIcs) Series ; v. 107 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, Z | - |
dc.contributor.author | Tang, Z | - |
dc.contributor.author | Wu, X | - |
dc.contributor.author | Zhang, Y | - |
dc.date.accessioned | 2018-09-14T08:58:05Z | - |
dc.date.available | 2018-09-14T08:58:05Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prague, Czech Republic, 9-13 July 2018, article no. 79:1--79:14 | - |
dc.identifier.isbn | 9783959770767 | - |
dc.identifier.uri | http://hdl.handle.net/10722/261433 | - |
dc.description.abstract | We introduce a weighted version of the ranking algorithm by Karp et al. (STOC 1990), and prove a competitive ratio of 0.6534 for the vertex-weighted online bipartite matching problem when online vertices arrive in random order. Our result shows that random arrivals help beating the 1-1/e barrier even in the vertex-weighted case. We build on the randomized primal-dual framework by Devanur et al. (SODA 2013) and design a two dimensional gain sharing function, which depends not only on the rank of the offline vertex, but also on the arrival time of the online vertex. To our knowledge, this is the first competitive ratio strictly larger than 1-1/e for an online bipartite matching problem achieved under the randomized primal-dual framework. Our algorithm has a natural interpretation that offline vertices offer a larger portion of their weights to the online vertices as time goes by, and each online vertex matches the neighbor with the highest offer at its arrival. | - |
dc.language | eng | - |
dc.publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. | - |
dc.relation.ispartof | Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) | - |
dc.relation.ispartofseries | Leibniz International Proceedings in Informatics (LIPIcs) Series ; v. 107 | - |
dc.subject | Online bipartite matching | - |
dc.subject | Randomized primal-dual | - |
dc.subject | Vertex weighted | - |
dc.title | Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Huang, Z: zhiyi@cs.hku.hk | - |
dc.identifier.authority | Huang, Z=rp01804 | - |
dc.identifier.doi | 10.4230/LIPIcs.ICALP.2018.79 | - |
dc.identifier.scopus | eid_2-s2.0-85049784654 | - |
dc.identifier.hkuros | 290750 | - |
dc.identifier.spage | 79:1 | - |
dc.identifier.epage | 79:14 | - |
dc.publisher.place | Dagstuhl, Germany | - |