TY - JOUR A1 - Besançon, Mathieu A1 - Anjos, Miguel F. A1 - Brotcorne, Luce T1 - Complexity of near-optimal robust versions of multilevel optimization problems JF - Optimization Letters N2 - Near-optimality robustness extends multilevel optimization with a limited deviation of a lower level from its optimal solution, anticipated by higher levels. We analyze the complexity of near-optimal robust multilevel problems, where near-optimal robustness is modelled through additional adversarial decision-makers. Near-optimal robust versions of multilevel problems are shown to remain in the same complexity class as the problem without near-optimality robustness under general conditions. Y1 - 2021 U6 - https://doi.org/10.1007/s11590-021-01754-9 VL - 15 IS - 8 SP - 2597 EP - 2610 ER -