Placeholder text

Go to cart

Non convex optimization in game theory

By Aicha Anzi

Non convex optimization in game theory

By Aicha Anzi

0 - Default Title
Description
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.
Product details
Binding:
Paperback
Number of Pages:
84
Release Date:
2025-12-04
Publication Date:
2025-12-04
Publisher:
LAP LAMBERT Academic Publishing
Languages:
Original: English
ISBN10:
6209391559
ISBN13:
9786209391552
Weight:
143 g
Height:
150 cm
Width:
220 cm
Thickness:
6 cm
Buy on Amazon
Currently sold out