Stochastic matching problem.

The matching problem plays a basic role in combinatorial optimization and in statistical mechanics. In its stochastic variants, optimization decisions have to be taken given only some probabilistic information about the instance. While the deterministic case can be solved in polynomial time, stochastic variants are worst-case intractable. We propose an efficient method to solve stochastic matching problems which combines some features of the survey propagation equations and of the cavity method. We test it on random bipartite graphs, for which we analyze the phase diagram and compare the results with exact bounds. Our approach is shown numerically to be effective on the full range of parameters, and to outperform state-of-the-art methods. Finally we discuss how the method can be generalized to other problems of optimization under uncertainty.

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

[2]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[3]  J Figueira,et al.  Stochastic Programming , 1998, J. Oper. Res. Soc..

[4]  Riccardo Zecchina,et al.  Statistical physics of optimization under uncertainty , 2010, ArXiv.

[5]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[6]  David Aldous,et al.  The ζ(2) limit in the random assignment problem , 2000, Random Struct. Algorithms.

[7]  Riccardo Zecchina,et al.  Statistical mechanics of budget-constrained auctions , 2009, ArXiv.

[8]  Zhen Liu,et al.  Performance Modeling and Engineering , 2010 .

[9]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[10]  Lenka Zdeborová,et al.  The number of matchings in random graphs , 2006, ArXiv.

[11]  Andrew J. Schaefer,et al.  A factor 1/2 approximation algorithm for two-stage stochastic matching problems , 2006, Eur. J. Oper. Res..

[12]  Riccardo Zecchina,et al.  Survey propagation as local equilibrium equations , 2003, ArXiv.

[13]  Riccardo Zecchina,et al.  Learning by message-passing in networks of discrete synapses , 2005, Physical review letters.

[14]  M. Mézard,et al.  On the solution of the random link matching problems , 1987 .

[15]  J. Spall.  STOCHASTIC OPTIMIZATION , 2002 .

[16]  Emanuele Trucco,et al.  Introductory techniques for 3-D computer vision , 1998 .

[17]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[18]  Dan Gusfield.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[19]  M. Mézard,et al.  Random K-satisfiability problem: from an analytic solution to an efficient algorithm. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Olivier Spanjaard,et al.  Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation , 2010, Eur. J. Oper. Res..

[21]  M. .. Moore.  Exactly Solved Models in Statistical Mechanics , 1983 .

[22]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[23]  Devavrat Shah,et al.  Message Passing for Maximum Weight Independent Set , 2008, IEEE Transactions on Information Theory.