In the article the task of finding the most preferred mixed strategies in finite scalar bimatrix game is studied. The equilibrium situation in the mixed strategies always exists in game according to the Nash theorem. The problem of finding an equilibrium in the game has a long history, but due to the complexity of the known algorithms and methods, that cause various problems, its study is being continued today. Our approach is different from these methods. In game each player primarily has his own interest in order to do so he can act different principles in addition to the principle of Nash equilibrium. Therefore we consider such a principle in mixed strategies. To apply such a principle, the player uses Adam Smith's principle of optimality, which does not take into account the interests of the partner and acts to achieve the best result so that it is the best for him.To achieve such a result, the player in the game ranks his pure strategies according to the advantages, for which he finds the weights of the strategies. The weight of the strategy corresponds to the probability of its choice. For such a ranking of the multiplicity of player strategies, we use Thomas Saaty’s simple method of analytical hierarchy. We obtain the weight vector of the pure strategies as the preferred mixed strategy. Relevant examples are given., {"references":["1.\tOwen G. Game Theory. Academic Press, Third Edition, 1995, 459 p.","2.\tVorob'ev N.N. Foundations of Game Theory. Noncooperative Games. Birkhauser Verlang, Basel – Boston – Berlin, 1994, 496 p.","3.\tBeltadze G. Game theory: A mathematikal theory of correlations and equilibrium. Georgian Technical University, Tbilisi, 2016, 505 p. (in Georgian).","4.\tVorob'ev N.N. Equilibrium situations in bimatrix games. Teor. Veroztnost I Primenen. 3, no. 3 1958, pp. 318-331 (in Russian).","5.\tKuhn H.W. An algoritm for equilibrium points in bimatrix games. Proc. Nat. Acad. Sci. USA 47, 1961, pp. 1657- 1662.","6.\tMangasarian O.L. Equilibrium points in bimatrix games\". Journal Soc. Industr. Appl. Math.,Vol 12,1964, pp. 778- 780.","7.\tLemke C. E. and Howson J.T. Equilibrium points of bimatrix games. Journal of the Society for Industrial and Applied Mathematics, Vol 12, no. 2, 1964, pp. 413-423.","8.\tRosenmuller J. On e generalization of the Lemke-Howson algorithm to noncooperative N-person games. SIAM Journal on Applied Mathematics, Vol 21, no. 1 (1971), pp. 73-79.","9.\tBeltadze G.N. Game Theory - basis of Higher Education and Teaching Organization\". International Journal of Modern Education and Computer Science (IJMECS). Hong Kong, Volume 8, Number 6, 2015, pp. 41-49.","10.\tSalukvadze M.E., Beltadze G.N. Strategies of Nonsolidary Behavior in Teaching Organization. International Journal of Modern Education and Computer Science (IJMECS). Hong Kong, Volume 9, Number 4, 2017, pp. 12-18.","11.\tLemke C.E. Bimatrix equilibrium points and mathematical programming. Management Schience. Vol 11, no. 7, New York, 1965, pp. 681-689.","12.\tSavani R. Finding Nash equilibria of bimatrix games. A thesis of PhD. London School of Economics and Political Science, 2009, 116 p.","13.\tBalthasar Anne Verena. Geometry and equilibria in bimatrix games. A thesis submitted for the degree of Doctor of Philosophy. Department of Mathematics London School of Economics and Political Science, 2009, 107 p.","14.\tBeltadze G.N. The Solution of Scalar Bimatrix Games in Preferred Pure Strategies. International Journal of Modern Education and Computer Science (IJMECS). Hong Kong, Volume 12, Number 3, June, 2020, pp. 1-7.","15.\tSaaty Thomas L. Fundamentals of Decision Making and Priority Theory with the Analytic Hierarchy Process. RWS Publications, 1994, 527 p.","16.\tBeltadze G.N. The problem of multiple election in the case of multicriteria candidates\". Transaction Technical University of Georgia, №4 (474), 2009, pp. 66-80 (in Georgian)."]}