Commitment under uncertainty: Two-stage stochastic matching problems
type: Item
instance of: scholarly article
title: Commitment under uncertainty: Two-stage stochastic matching problems
zbMATH Open document ID: 1165.90583
author: Irit Katriel
author: Claire Kenyon-Mathieu
author: Eli Upfal
published in: Theoretical Computer Science
publication date: 2008-12-12T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5382277
zbMATH Keywords: stochastic combinatorial optimization
zbMATH Keywords: matching algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.08.010
OpenAlex ID: W2044027392
cites work: Introduction to Stochastic Programming
cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
cites work: Fundamentals of Computation Theory
cites work: On Two-Stage Stochastic Minimum Spanning Trees
cites work: The stochastic single resource service-provision problem
cites work: Algorithms and Computation
cites work: On the random 2-stage minimum spanning tree
cites work: Automata, Languages and Programming
cites work: Boosted sampling
cites work: Q5501328
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
cites work: Q3048571
cites work: Optimization, approximation, and complexity classes
cites work: Integer Programming and Combinatorial Optimization
cites work: Q4527015
cites work: Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
cites work: The sample average approximation method applied to stochastic routing problems: a computational study
DOI: 10.1016/J.TCS.2008.08.010
Recommended article: Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Recommended article: Stochastic Matching with Commitment
Recommended article: Paths to stability in two-sided matching under uncertainty
Recommended article: Probabilistic stable rules and Nash equilibrium in two-sided matching problems
Recommended article: Two-stage flexible-choice problems under uncertainty
Recommended article: Stable matching with uncertain pairwise preferences
Recommended article: Stable matching with uncertain linear preferences
Recommended article: Stable Matching with Uncertain Linear Preferences
Recommended article: Q5128460
description: scientific article; zbMATH DE number 5382277