Worst-case expected ex post regret over a type-1 Wasserstein ball equals nominal expected regret plus the Wasserstein radius times the maximal dual-norm distance from the decision to the feasible set.
On the complexity of m inmax regret linear programming
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
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Distributionally Robust Regret Minimization
Worst-case expected ex post regret over a type-1 Wasserstein ball equals nominal expected regret plus the Wasserstein radius times the maximal dual-norm distance from the decision to the feasible set.