A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems
SIAM Journal on Optimization · 31.12.2024 · 34 (4) · 3371-3398
DOI: 10.1137/23m1548189 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 03.10.2024. Verfasst von Peter Kirst und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 33 Literaturangaben.
Abstract (Originalsprache)
This paper introduces a spatial branch-and-bound method for the computation of the set of all [Formula: see text]-Nash equilibria of continuous box-constrained nonconvex Nash equilibrium problems with an approximation guarantee. Thereby, the existence of [Formula: see text]-Nash equilibria is not assumed, but the algorithm is also able to detect their absence. We explain appropriate discarding and fathoming techniques, provide a termination proof for a prescribed approximation tolerance, and report our computational experience.
Zitieren
APA
Kirst, P., Schwarze, S., & Stein, O. (2024). A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems. SIAM Journal on Optimization, 34(4), 3371-3398. https://doi.org/10.1137/23m1548189
Vancouver
Kirst P, Schwarze S, Stein O. A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems. SIAM Journal on Optimization. 2024;34(4):3371-3398. doi:10.1137/23m1548189
BibTeX
@article{Kirst2024,
author = {Kirst, Peter and Schwarze, Stefan and Stein, Oliver},
title = {A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems},
journal = {SIAM Journal on Optimization},
year = {2024},
volume = {34},
number = {4},
pages = {3371--3398},
doi = {10.1137/23m1548189}
}
EUVIMED