A branch-and-prune algorithm for discrete Nash equilibrium problems

We present a branch-and-prune procedure for discrete Nash equilibrium problems with a convex description of each player's strategy set. The derived pruning criterion does not require player convexity, but only strict convexity of some player's objective function in a single variable. If sa...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational optimization and applications Jg. 86; H. 2; S. 491 - 519
Hauptverfasser:	Schwarze, Stefan, Stein, Oliver
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY Springer US 01.11.2023 Springer Nature B.V
Schlagworte:	Algorithms Branch and bound Branch and prune Convex and Discrete Geometry Convexity Discrete game Equilibrium Game theory Integer programming Management Science Mathematical analysis Mathematics Mathematics and Statistics Nash equilibrium problem Operations Research Operations Research/Decision Theory Optimization Statistics Variables Nash equilibrium problem Branch and prune Discrete game Branch and bound
ISSN:	1573-2894, 0926-6003, 1573-2894
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!