@article{BesanconAnjosBrotcorne, author = {Besan{\c{c}}on, Mathieu and Anjos, Miguel F. and Brotcorne, Luce}, title = {Complexity of near-optimal robust versions of multilevel optimization problems}, series = {Optimization Letters}, volume = {15}, journal = {Optimization Letters}, number = {8}, doi = {10.1007/s11590-021-01754-9}, pages = {2597 -- 2610}, abstract = {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.}, language = {en} }