... with quadratic payoffs, multi-dimensional strategy spaces, and possibly shared constraints on strategies, and investigate conditions when this game admits a weighted potential. Since a potential is generally nonconvex in this case, we propose local and global search procedures for maximizing it over the set of admissible game profiles. The local search uses nonlinear support functions that are constructed through a d.c.-decomposition of the potential. The global search is based on reducing of a certain ...
Теги: d.c decomposition , nash equilibrium , nonconvex optimization , weighted potential , computation theory , game theory , quadratic programming , d.c. decomposition , global search procedure , mixed integer linear programming problems , nash equilibria , nonconvex qua
