Skip to main content
Journal Article

Polynomial time algorithm for determining optimal strategies in cyclic games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3064 74-85
DOI: 10.1007/978-3-540-25960-2_6
6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Lozovanu, D. (2004). Polynomial time algorithm for determining optimal strategies in cyclic games. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3064, 74–85. https://doi.org/10.1007/978-3-540-25960-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free