LAP LAMBERT Academic Publishing

Non convex optimization in Game theory: Investigation of DC Programming Method for Bimatrix Solutions

Name: Non convex optimization in Game theory: Investigation of DC Programming Method for Bimatrix Solutions
Brand: LAP LAMBERT Academic Publishing
SKU: 13cb6815ef95ca101ee96c0d68f67b70

1/1

Afbeelding van Non convex optimization in Game theory: Investigation of DC Programming Method for Bimatrix Solutions

Bol

Prijzen vanaf

43,90

Uitgelicht

	43,90	Naar shop
	43,99	Naar shop
VERGELIJK ALLE AANBIEDERS (2)

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.

Lees meer

Vergelijk aanbieders (2)

Sorteren op:

€ 43,90 Gratis verzending

€ 43,99 Gratis verzending

Beschrijving (1)

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.

Lees meer