Estimation of the Complexity of the Potential Transformation Algorithm for Solving Cyclic Games on Graphs

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 grap...

Full description

Saved in:
Bibliographic Details
Published inJournal of computer & systems sciences international Vol. 58; no. 3; pp. 425 - 433
Main Authors Bashlaeva, I. A., Kovkov, D. V.
Format Journal Article
LanguageEnglish
Published Moscow Pleiades Publishing 01.05.2019
Springer Nature B.V
Subjects
Algorithms
Complexity
Control
Engineering
Games
Graph theory
Graphs
Lower bounds
Mechatronics
Robotics
Systems Analysis and Operations Research
Transformations
Upper bounds
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1064-2307
1555-6530
DOI:10.1134/S106423071903002X