Non convex optimization in Game theory: Investigation of DC Programming Method for Bimatrix Solutions
Uitgelicht
|
43,90 |
Naar shop
|
|
43,90 |
Naar shop
|
|
43,99 |
Naar shop
|
Beschrijving
Bol
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.
Beschrijving
(2)
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.
AmazonPagina's: 84, Paperback, LAP LAMBERT Academic Publishing
ProductspecificatiesPrijzen voor het laatst bijgewerkt op:
Gerelateerde producten
