Отправить статью по E-mail Estimation of the Complexity of the Potential Transformation Algorithm for Solving Cyclic Games on Graphs
- Авторы: Bashlaeva I.1, Kovkov D.2
-
Учреждения:
- Volgograd State University
- Federal Research Center Computer Science and Control, Russian Academy of Sciences
- Выпуск: Том 58, № 3 (2019)
- Страницы: 425-433
- Раздел: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/220385
- DOI: https://doi.org/10.1134/S106423071903002X
- ID: 220385
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
The upper bound on the complexity of the potential transformation algorithm for solving cyclic games on graphs is improved. This bound is close to the lower bound on the complexity of the potential transformation algorithm. The optimal deviation problem is reduced to a cyclic game on a directed graph.
Об авторах
I. Bashlaeva
Volgograd State University
Автор, ответственный за переписку.
Email: bashlaeva_ia@volsu.ru
Россия, Volgograd, 400062
D. Kovkov
Federal Research Center Computer Science and Control, Russian Academy of Sciences
Email: bashlaeva_ia@volsu.ru
Россия, Moscow, 119333
