Name
Abstract | ||
|---|---|---|
The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete scenario reduction, where the new atoms must be chosen from among the existing ones. Using the Wasserstein distance as measure of proximity between distributions, we identify those n-point distributions on the unit ball that are least susceptible to scenario reduction, i.e., that have maximum Wasserstein distance to their closest m-point distributions for some prescribed \(m<n\). We also provide sharp bounds on the added benefit of continuous over discrete scenario reduction. Finally, to our best knowledge, we propose the first polynomial-time constant-factor approximations for both discrete and continuous scenario reduction as well as the first exact exponential-time algorithms for continuous scenario reduction. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s10107-018-1269-1 | Mathematical Programming |
Keywords | DocType | Volume |
Scenario reduction,Wasserstein distance,Constant-factor approximation algorithm,k-median clustering,k-means clustering | Journal | 191 |
Issue | ISSN | Citations |
1 | 1436-4646 | 0 |
PageRank | References | Authors |
0.34 | 22 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| napat rujeerapaiboon | 1 | 0 | 1.69 |
| Kilian Schindler | 2 | 0 | 0.34 |
| Daniel Kuhn | 3 | 559 | 32.80 |
| Wolfram Wiesemann | 4 | 416 | 21.96 |