Improved Approximation Algorithms for Stochastic-Matching Problems

We consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. In this problem, we are given an undirected graph. Each edge is assigned a known, independent probability of existence and a positive weight (or profit). We must probe an edge to discover whether or not it exists. Each node is assigned a positive integer called a timeout (or a patience). On this random graph we are executing a process, which probes the edges one-by-one and gradually constructs a matching. The process is constrained in two ways. First, if a probed edge exists, it must be added irrevocably to the matching (the query-commit model). Second, the timeout of a node $v$ upper-bounds the number of edges incident to $v$ that can be probed. The goal is to maximize the expected weight of the constructed matching. For this problem, Bansal et al. (Algorithmica 2012) provided a $0.33$-approximation algorithm for bipartite graphs and a $0.25$-approximation for general graphs. We improve the approximation factors to $0.39$ and $0.269$, respectively. The main technical ingredient in our result is a novel way of probing edges according to a not-uniformly-random permutation. Patching this method with an algorithm that works best for large-probability edges (plus additional ideas) leads to our improved approximation factors.

[1]  Aravind Srinivasan,et al.  Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts , 2017, Algorithmica.

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

[3]  Patrick Jaillet,et al.  Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..

[4]  Van-Anh Truong,et al.  Prophet Inequality with Correlated Arrival Probabilities, with Application to Two Sided Matchings , 2019, 1901.02552.

[5]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Parag A. Pathak,et al.  The New York City High School Match , 2005 .

[7]  Nicole Immorlica,et al.  Adversarial Bandits with Knapsacks , 2018, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[8]  Ola Svensson,et al.  Beating Greedy for Stochastic Bipartite Matching , 2019, SODA.

[9]  Tuomas Sandholm,et al.  Multi-Organ Exchange: The Whole Is Greater than the Sum of its Parts , 2014, AAAI.

[10]  Aleksandrs Slivkins,et al.  Online decision making in crowdsourcing markets: theoretical challenges , 2013, SECO.

[11]  Jan Vondrák,et al.  Adaptivity and approximation for stochastic packing problems , 2005, SODA '05.

[12]  Maxim Sviridenko,et al.  Submodular Stochastic Probing on Matroids , 2013, Math. Oper. Res..

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

[14]  Jignesh M. Patel,et al.  SAGA: a subgraph matching tool for biological graphs , 2007, Bioinform..

[15]  Aravind Srinivasan,et al.  Solving Packing Integer Programs via Randomized Rounding with Alterations , 2012, Theory Comput..

[16]  Alexander J. Smola,et al.  Learning Graph Matching , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Fabrizio Grandoni,et al.  Improved Approximation Algorithms for Stochastic Matching , 2015, ESA.

[18]  Matthew Brand,et al.  Stochastic Shortest Paths Via Quasi-convex Maximization , 2006, ESA.

[19]  Jian Li,et al.  Decision making under uncertainty , 2011 .

[20]  Nima Reyhani,et al.  Almost Optimal Stochastic Weighted Matching with Few Queries , 2018, EC.

[21]  Prasad Tetali,et al.  Stochastic Matching with Commitment , 2012, ICALP.

[22]  Atri Rudra,et al.  Approximating Matches Made in Heaven , 2009, ICALP.

[23]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[24]  Sudipto Guha,et al.  Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[25]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[26]  Jianzhong Li,et al.  Efficient Subgraph Matching on Billion Node Graphs , 2012, Proc. VLDB Endow..

[27]  Aleksandrs Slivkins,et al.  Bandits with Knapsacks , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[28]  Rajiv Gandhi,et al.  Dependent rounding and its applications to approximation algorithms , 2006, JACM.

[29]  Chaitanya Swamy,et al.  Approximation algorithms for 2-stage stochastic optimization problems , 2006, SIGA.

[30]  Takanori Maehara,et al.  Stochastic packing integer programs with few queries , 2017, Mathematical Programming.

[31]  Aravind Srinivasan,et al.  Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[32]  Aravind Srinivasan,et al.  Vertex-weighted Online Stochastic Matching with Patience Constraints , 2019, ArXiv.

[33]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[34]  Aravind Srinivasan,et al.  Improved Bounds in Stochastic Matching and Optimization , 2015, APPROX-RANDOM.

[35]  Aravind Srinivasan,et al.  New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching , 2016, ESA.

[36]  David Simchi-Levi,et al.  Multi-Stage and Multi-Customer Assortment Optimization With Inventory Constraints , 2019, ArXiv.

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

[38]  Yang Li,et al.  The Stochastic Matching Problem with (Very) Few Queries , 2016, EC.

[39]  Jon Feldman,et al.  Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.

[40]  Eli Upfal,et al.  Commitment under uncertainty: Two-stage stochastic matching problems , 2007, Theor. Comput. Sci..

[41]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[42]  R. Ravi,et al.  The Query-commit Problem , 2011, ArXiv.

[43]  Will Ma,et al.  Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract , 2013, SODA.

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

[45]  Yang Li,et al.  The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm , 2017, EC.

[46]  Aravind Srinivasan,et al.  Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals , 2018, AAMAS.

[47]  Nikhil R. Devanur,et al.  Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.

[48]  Ghassan Hamarneh,et al.  A Survey on Shape Correspondence , 2011, Comput. Graph. Forum.

[49]  Ariel D. Procaccia,et al.  Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries , 2014, EC.

[50]  Marek Adamczyk,et al.  Improved analysis of the greedy algorithm for stochastic matching , 2011, Inf. Process. Lett..