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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computational optimization and applications Ročník 86; číslo 2; s. 491 - 519
Hlavní autoři:	Schwarze, Stefan, Stein, Oliver
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY Springer US 01.11.2023 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!