Evolution, games theory and polyhedra (Q1096563)

The problem to construct an algorithm for the search for evolutionary stable strategies (ESS) for arbitrary fitness matrices A of an animal species is formulated. The connection with game theory is pointed out. ESS are defined by two inequalities. One of them is the definition of equilibrium points (EP) in 2-players games with non-zero sum, where the pay-off matrix of the first player is A and the pay-off matrix of second player is A' (transposed). All EP in mixed strategies are shown to be obtainable from the set of vertices (V) of a special convex polyhedron defined in the paper. If V satisfies the other inequality then it is an ESS. The role of testing V not to be an ESS is given. According to this role, an algorithm for finding ESS is proposed by using a quadratic programming model on a simplex. For finding the set of V another algorithm of the author [Am. Math. Mon. 93, 681-695 (1986; Zbl 0618.90065)] based on Fourier methods is used. A great number of numerical examples is available. An approach to finding ESS with the aid of a linear complementarity problem is discussed.