Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs

DOI10.1134/S106423071903002XzbMath1431.91061MaRDI QIDQ2290510

I. A. Bashlaeva, D. V. Kovkov

Publication date: 28 January 2020

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

complexitycyclic games on graphspotential transformation algorithm

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57) Algorithmic game theory and complexity (91A68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of pursuit on a graph
• Minimax in transportation models with integral constraints. I
• Complexity of problems in games, graphs and algebraic equations
• On the complexity of some two-person perfect-information games
• The complexity of mean payoff games on graphs
• An average polynomial algorithm for solving antagonistic games on graphs
• Optimization of schedules with precedence logical conditions
• Minimax in transportation models with integral constraints. II
• The Complexity of Solving Stochastic Games on Graphs
• Algorithms – ESA 2005
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs