Articles liés à Non convex optimization in game theory: Investigation...

Non convex optimization in game theory: Investigation of DC Programming Method for Bimatrix Game Solutions - Couverture souple

ANZI, Aicha; Kasri, Ramzi; Lenouar, Hicham

 
9786209391552: Non convex optimization in game theory: Investigation of DC Programming Method for Bimatrix Game Solutions
Couverture souple
ISBN 10 : 6209391559 ISBN 13 : 9786209391552
Editeur : LAP LAMBERT Academic Publishing, 2025

Synopsis

The search for the Nash equilibrium is a fundamental problem in game theory. In this manuscript, we focus on computing this equilibrium for bimatrix games with mixed strategies. Our objective is to investigate the application of nonconvex optimization techniques, specifically DC programming (Difference of Convex functions) and the DCA (DC Algorithm). The proposed approach involves reformulating the game as a linear complementarity problem, modeling it as an optimization problem, and finally solving it using DC programming and DCA. A comparative analysis with the well-known Lemke-Howson algorithm is also provided.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2025
Langue
anglais
ISBN 10 
6209391559
ISBN 13 
9786209391552
Reliure
Broché
Nombre de pages
84
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne