Abstract

This paper presents a nonconvex approach for computing a Nash equilibrium in bimatrix games. It relies on the Linear Complementarity Problem (LCP) formulation of the game and follows the Difference of Convex Algorithm (DCA) general scheme. To measure the performance of the proposed approach, numerical experiments as well as a comparative study with the Lemke Howson (LH) algorithm are carried out.

Full Text
Paper version not known

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 call

Disclaimer: 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.