Extracting winning strategies in update games

Liu, J
Khaliq, I
Khoussainov, B
Item type
Conference Contribution
Degree name
Journal Title
Journal ISSN
Volume Title
Springer Berlin / Heidelberg

This paper investigates algorithms for extracting winning strategies in two-player games played on nite graphs. We focus on a special class of games called update games. We present a procedure for extracting winning strategies in update games by constructing strategies explicitly. This is based on an algorithm that solves update games in quadratic time. We also show that solving update games with a bounded number of nondeterministic nodes takes linear time.

Games , Update networks , Finite state strategies
Computer Science: models of Computation in Context: proceedings from the 7th Conference on Computability in Europe (CiE'11), Sofia, Bulgaria, vol.6735, pp. 142 - 151
Rights statement
An author may self-archive an author-created version of his/her article on his/her own website and or in his/her institutional repository. He/she may also deposit this version on his/her funder’s or funder’s designated repository at the funder’s request or as a result of a legal obligation, provided it is not made publicly available until 12 months after official publication. He/ she may not use the publisher's PDF version, which is posted on www.springerlink.com, for the purpose of self-archiving or deposit. Furthermore, the author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at www.springerlink.com”. (Please also see Publisher’s Version and Citation)