An Average Polynomial Algorithm for Solving Antagonistic Games on Graphs
- Autores: Lebedev V.1, Tsurkov V.2
-
Afiliações:
- Volgograd State University
- Trapeznikov Institute of Control Sciences
- Edição: Volume 57, Nº 1 (2018)
- Páginas: 88-96
- Seção: Discrete Systems
- URL: https://journals.rcsi.science/1064-2307/article/view/220061
- DOI: https://doi.org/10.1134/S1064230718010045
- ID: 220061
Citar
Resumo
An algorithm that determines the winner in a cyclic game in polynomial time is proposed. The two-person game occurs continuously on the edges of a directed graph until a vertex visited earlier is reached. If the weight of the resulting cycle is nonnegative, then the maximizing player wins; if this cycle has a negative weight, then the minimizing player wins. A polynomial estimate of the expected algorithm execution time is obtained under the condition that the weights of the game’s graph edges are distributed uniformly. A brief justification of the time estimate of the algorithm is given. Such games have applications in the validating the correctness of parallel-distributed computer systems, including problems of making up a feasible schedule with logical precedence conditions and preprocessing possibilities.
Sobre autores
V. Lebedev
Volgograd State University
Email: tsur@ccas.ru
Rússia, Volgograd
V. Tsurkov
Trapeznikov Institute of Control Sciences
Autor responsável pela correspondência
Email: tsur@ccas.ru
Rússia, Moscow, 117997
![](/img/style/loading.gif)