Olhovskaya E. Combinatorial problems of the gaming type on a set of arrangements

We prove the convergence of the iterative method for solving combinatorial optimization problems of the gaming type on a set of permutations. We confirm theoretical estimate of complexity of the iterative method of Brown-Robinson type for solving combinatorial optimization problems of the gaming type on a set of permutations. We suggest estimation of the rate of convergence of the iterative method of Brown-Robinson type for solving combinatorial optimization problems of the gaming type on the set of permutations and spread it to the combinatorial game problems with the restrictions determined by different types of combinatorial configurations. We introduce for consideration new models of combinatorial optimization problems of the gaming type on a set of arrangements. The study spreads the iterative method of Brown-Robinson type on tasks in which combinatorial restrictions-permutations are imposed on the strategies of both players and in which the restrictions determined by locations are imposed on the strategies of one player. A monotonic iterative method is suggested for solving combinatorial optimization problems of the gaming type on a set of permutations.