Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm

We consider the generalizations of two classical problems, online bipartite matching and ski rental, in the field of online algorithms, and establish a novel connection between them.

[1]  Nikhil R. Devanur,et al.  Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching , 2013, SODA.

[2]  Atri Rudra,et al.  When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings , 2010, Algorithmica.

[3]  Gagan Goel,et al.  Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.

[4]  Aranyak Mehta,et al.  Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.

[6]  Boaz Patt-Shamir,et al.  Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental , 2008, SIAM J. Discret. Math..

[7]  Bala Kalyanasundaram,et al.  An optimal deterministic algorithm for online b-matching , 1996, Theor. Comput. Sci..

[8]  Avrim Blum,et al.  Online algorithms for market clearing , 2002, SODA '02.

[9]  Aranyak Mehta,et al.  Online bipartite matching with unknown distributions , 2011, STOC '11.

[10]  Amin Saberi,et al.  Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.

[11]  Aranyak Mehta,et al.  Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.

[12]  Vangelis Th. Paschos,et al.  On-line vertex-covering , 2005, Theor. Comput. Sci..

[13]  Aranyak Mehta,et al.  Online Matching and Ad Allocation , 2013, Found. Trends Theor. Comput. Sci..

[14]  Mohammad Mahdian,et al.  Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.

[15]  Nikhil R. Devanur,et al.  Online matching with concave returns , 2012, STOC '12.

[16]  Mariangiola Dezani-Ciancaglini,et al.  A Discrimination Algorithm Inside lambda-beta-Calculus , 1979, Theor. Comput. Sci..

[17]  Claire Mathieu,et al.  Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.

[18]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[19]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[20]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[21]  Jon Feldman,et al.  Online Ad Assignment with Free Disposal , 2009, WINE.

[22]  Thomas P. Hayes,et al.  The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.

[23]  Nikhil R. Devanur,et al.  Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders , 2016 .

[24]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[25]  Claire Mathieu,et al.  On-line bipartite matching made simple , 2008, SIGA.