An experimental study of a DC optimization algorithm for bimatrix games

DOI10.1142/S1793557121501436MaRDI QIDQ5164671zbMATH OpenOpenAlexFDO

Authors Aicha Anzi, Ramzi Kasri, Hicham Lenouar, 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

bimatrix gamesDC optimizationDCALCPNash equilibrium

Mathematics Subject Classification ID

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

Recommendations

• Seeking the equilibrium situations in bimatrix games
• Numerical search for the equilibria in bimatrix games
• A procedure for finding Nash equilibria in bi-matrix games
• An optimization approach for approximate Nash equilibria
• Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games

Cites work

• A new polynomial-time algorithm for linear programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Convex Analysis
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Equilibrium Points of Bimatrix Games
• scientific article; zbMATH DE number 1099369 (Why is no real title available?)
• Non-cooperative games
• On solving linear complementarity problems by DC programming and DCA
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• Solving the linear complementarity problem through concave programming
• Transactions on Computational Collective Intelligence XIII

Cited in

(1)

• Numerical search for the equilibria in bimatrix games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164671)