The two-stage stochastic assignment game is polynomial-time solvable for explicit distributions, and its LP relaxation has an integral polyhedron.
Online multistage subset maximization problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Two-stage Stochastic Assignment Games
The two-stage stochastic assignment game is polynomial-time solvable for explicit distributions, and its LP relaxation has an integral polyhedron.