Non convex optimization in game theory: Investigation of DC Programming Method for Bimatrix Game Solutions
by Aicha Anzi, Ramzi Kasri, Hicham Lenouar
This academic work examines non-convex optimization in game theory through the investigation of DC programming methods for bimatrix game solutions. It offers a focused treatment of mathematical programming concepts and their application to the analysis of bimatrix games, making it relevant to readers exploring optimization and game theory.
About This Book
This work investigates non-convex optimization within the field of game theory.
It focuses on DC programming, a method based on differences of convex functions, in the context of bimatrix game solutions.
The book is oriented toward mathematical and computational approaches for examining optimization problems associated with bimatrix games.
Its subject will interest readers studying optimization, mathematical programming, and game-theoretic solution methods.
Reviews
No reviews yet. Be the first to review this book!