... 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 nonconvex quadratic programming problem to a mixed-integer linear programming problem. Copyright © by the paper's authors. нет
Теги: 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
