An experimental study of a DC optimization algorithm for bimatrix games

DOI10.1142/S1793557121501436zbMath1473.90123OpenAlexW3092582853MaRDI QIDQ5164671

Hicham Lenouar, Aicha Anzi, Ramzi Kasri, Mohammed Said Radjef

Publication date: 12 November 2021

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557121501436

zbMATH Keywords

DCANash equilibriumbimatrix gamesLCPDC optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) 2-person games (91A05) Experimental studies (91A90)

Cites Work

• Unnamed Item
• On solving linear complementarity problems by DC programming and DCA
• A new polynomial-time algorithm for linear programming
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Transactions on Computational Collective Intelligence XIII
• Non-cooperative games
• Solving the linear complementarity problem through concave programming
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• Convex Analysis

This page was built for publication: An experimental study of a DC optimization algorithm for bimatrix games