Polynomial time algorithm for determining optimal strategies in cyclic games

DOI10.1007/978-3-540-25960-2_6MaRDI QIDQ5712475zbMATH OpenOpenAlexFDO

Authors Dmitrii Lozovanu

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b97946

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43)

Cited in

(8)

• Computational complexity of winning strategies in two-person polynomial games
• Dominant strategy implementability and zero length cycles
• A constructive algorithm for max-min paths problems on energy networks
• Discrete control and algorithms for solving antagonistic dynamic games on networks
• Nash Equilibria Conditions for Cyclic Games with p Players
• scientific article; zbMATH DE number 29719 (Why is no real title available?)
• scientific article; zbMATH DE number 3892974 (Why is no real title available?)
• Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game

This page was built for publication: Polynomial time algorithm for determining optimal strategies in cyclic games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712475)