Commitment under uncertainty: Two-stage stochastic matching problems

We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version, the uncertainty is in the second stage costs of the edges, and in the other version, the uncertainty is in the set of vertices that needs to be matched. We prove lower bounds, and analyze efficient strategies for both cases. These problems model real-life stochastic integral planning problems, such as commodity trading, reservation systems and scheduling under uncertainty.

Authors

• Irit Katriel Meinolf Sellmann
• Claire Kenyon-Mathieu
• Eli Upfal

Keywords

• Stochastic combinatorial optimization
• Matching algorithm