Answers are grounded in this paper and cite their sources.
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 satisfied, it prunes choices for this variable by stating activity of certain constraints. This results in a synchronous branching and pruning method. An algorithmic implementation and numerical tests are presented for randomly generated instances with convex polyhedral strategy sets and convex quadratic as well as non-convex quadratic objective functions.
No takes yet. Share an insight, caveat, or question.
Schwarze et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: