Abstract
The problem of numerical finding of a Nash equilibrium in a 3-player polymatrix game is considered. Such a game can be completely described by six matrices, and it turns out to be equivalent to the solving a nonconvex optimization problem with a bilinear structure in the objective function. Special methods of local and global search for the optimization problem are proposed and investigated. The results of computational solution of the test game are presented and analyzed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
