Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
- Cite this paper as:
- Katriel I., Kenyon-Mathieu C., Upfal E. (2007) Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. In: Arge L., Cachin C., Jurdziński T., Tarlecki A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg
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, 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.
Unable to display preview. Download preview PDF.