Публикации

Search of Nash equilibrium in quadratic nonconvex game with weighted potential

Статья конференции
Minarchenko I.
2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018
CEUR Workshop Proceedings. Vol.2098. P.291-303.
2018
We consider an n-player nonconvex continuous game 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 nonconvex quadratic programming problem to a mixed-integer linear programming problem. Copyright © by the paper's authors.
Minarchenko I. Search of Nash equilibrium in quadratic nonconvex game with weighted potential // CEUR Workshop Proceedings. Vol.2098. 2018. P.291-303.
SCOPUS

Телефоны

основной    +7(3952) 500-646
приемная    +7(3952) 42-47-00
факс     +7(3952) 42-67-96
Смотреть справочник