Solving game theory problems using linear programming and genetic algorithms

11Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we proposed an efficient genetic algorithm that will be applied to linear programming problems in order to find out the Fittest Chromosomes. This paper aim to find the optimal strategy of game theory in basketball by using genetic algorithms and linear programming as well as the comparison between traditional methods and modern methods being represented in artificial intelligence, Genetic algorithms as applied in this paper. A new method was adopted in finding the optimal game strategy for player (A) and player (B) through the application of linear programming and finding solutions by using (GA) in MATLAB. The final results confirmed the equivalent of linear programming and genetic algorithms as the model was in the linear approach, and in the case of nonlinearity, genetic algorithm will be in favor definitely. The Matlab program in the calculation of the results for great possibility optimization should also be adopted.

Cite

CITATION STYLE

APA

Ashour, M. A. H., Al-Dahhan, I. A. H., & Al-Qabily, S. M. A. (2020). Solving game theory problems using linear programming and genetic algorithms. In Advances in Intelligent Systems and Computing (Vol. 1018, pp. 247–252). Springer Verlag. https://doi.org/10.1007/978-3-030-25629-6_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free