8555 2021 eng 2597 2610 8 15 article 0 -- -- -- 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. Optimization Letters 10.1007/s11590-021-01754-9 yes 2021-05-19 publish Mathieu Besançon Mathieu Besançon Miguel F. Anjos Luce Brotcorne MODAL-SynLab MODAL-Gesamt AI in Society, Science, and Technology